Merge Two Sorted Lists problem results
I should try a recursive method later.
First Blood
Iterative method.
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
52
53
54
55
56
{
ListNode* mergeTwoLists(ListNode* list1, ListNode* list2) {
if(list1 == nullptr)
{
return list2;
}
if(list2 == nullptr)
{
return list1;
}
ListNode* result = nullptr;
if(list1->val <= list2->val)
{
result = list1;
list1 = list1->next;
}
else
{
result = list2;
list2 = list2->next;
}
ListNode* temp = result;
while(list1 != nullptr && list2 != nullptr)
{
if(list1->val <= list2->val)
{
temp->next = list1;
list1 = list1->next;
}
else
{
temp->next = list2;
list2 = list2->next;
}
temp = temp->next;
}
if(list1 != nullptr)
{
temp->next = list1;
}
if(list2 != nullptr)
{
temp->next = list2;
}
return result;
}
}