-
Notifications
You must be signed in to change notification settings - Fork 1
/
03.merge_two_sorted_linkedlist.cpp
37 lines (36 loc) · 1.05 KB
/
03.merge_two_sorted_linkedlist.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
// https://leetcode.com/problems/merge-two-sorted-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* list1, ListNode* list2) {
ListNode* result = new ListNode(0);
ListNode* curr = result;
while(list1 != NULL && list2 != NULL) {
if (list1->val < list2->val) {
ListNode* t = new ListNode(list1->val);
curr->next = t;
list1 = list1->next;
} else {
ListNode* t = new ListNode(list2->val);
curr->next = t;
list2 = list2->next;
}
curr = curr->next;
}
if (list1 != NULL) {
curr->next = list1;
} else {
curr->next = list2;
}
return result->next;
}
};