forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path21.cpp
More file actions
51 lines (46 loc) · 1.14 KB
/
21.cpp
File metadata and controls
51 lines (46 loc) · 1.14 KB
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
47
48
49
50
51
// Merged Two Sorted Linked Lists
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
if(l1==NULL || l2==NULL)
return l1==NULL?l2:l1;
ListNode* head=new ListNode(-1);
ListNode* prev=head;
ListNode* curr1=l1;
ListNode* curr2=l2;
while(curr1!=NULL && curr2!=NULL)
{
if(curr1->val<=curr2->val)
{
prev->next=curr1;
prev=curr1;
curr1=curr1->next;
}
else
{
prev->next=curr2;
prev=curr2;
curr2=curr2->next;
}
}
if(curr1!=NULL)
{
prev->next=curr1;
}
if(curr2!=NULL)
{
prev->next=curr2;
}
return head->next;
}
};