-
Notifications
You must be signed in to change notification settings - Fork 1
/
MergeTwoSortedLists.cpp
46 lines (44 loc) · 1.15 KB
/
MergeTwoSortedLists.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
/*
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.
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if(!l1)
return l2;
if(!l2)
return l1;
ListNode *L = new ListNode(0);
ListNode *head = L;
while(l1&&l2)
{
if(l1->val<l2->val)
{
L->next = new ListNode(l1->val);
l1 = l1->next;
}
else
{
L->next = new ListNode(l2->val);
l2 = l2->next;
}
L = L->next;
}
while(l1)
{
L->next = new ListNode(l1->val);
l1 = l1->next;
L = L->next;
}
while(l2)
{
L->next = new ListNode(l2->val);
l2 = l2->next;
L = L->next; // dont forget
}
return head->next;
}
};