-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge_two_sorted_lists.cpp
More file actions
47 lines (43 loc) · 1.15 KB
/
merge_two_sorted_lists.cpp
File metadata and controls
47 lines (43 loc) · 1.15 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
/**
* 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* list1, ListNode* list2) {
ListNode* head = nullptr;
ListNode* tail;
while(list1 || list2){
ListNode* cand;
if(list1 && list2){
if(list1->val < list2->val){
cand = list1;
list1 = list1->next;
}else{
cand = list2;
list2 = list2->next;
}
}else if(list1){
cand = list1;
list1 = list1->next;
}else{
cand = list2;
list2 = list2->next;
}
if(head == nullptr){
head = cand;
tail = head;
}else{
tail->next = cand;
tail = tail->next;
}
}
return head;
}
};