Leetcode:Merge Two Sorted Lists
阿新 • • 發佈:2018-12-27
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
1為了操作方便,我們給拼接後的新連結串列新增一個頭結點 本文地址
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { //為操作方便,新增一個頭節點 ListNode node(0), *p = &node; while(l1 && l2) { if(l1->val < l2->val) { p->next = l1; l1 = l1->next; } else { p->next = l2; l2 = l2->next; } p = p->next; } if(l1)p->next = l1; else if(l2)p->next = l2; return node.next; } };