-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
78 lines (61 loc) · 1.19 KB
/
Copy pathmain.cpp
File metadata and controls
78 lines (61 loc) · 1.19 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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
// 合并两个排序的链表, 使得合并后的链表也是已排序的.
#include <iostream>
struct ListNode
{
int m_value;
ListNode *m_next;
};
ListNode *CreateNode(int *arr, int len)
{
ListNode *root = new ListNode;
root->m_next = nullptr;
root->m_value = arr[0];
ListNode *tmpNode = root;
for (int i = 1; i < len; ++i)
{
ListNode *newNode = new ListNode;
newNode->m_value = arr[i];
newNode->m_next = nullptr;
tmpNode->m_next = newNode;
tmpNode = newNode;
}
return root;
}
void DeleteAllNode(ListNode *&root)
{
while (root)
{
ListNode *nextNode = root;
root = root->m_next;
delete nextNode;
}
}
ListNode *Merge(ListNode *root1, ListNode *root2)
{
if (!root1)
return root2;
if (!root2)
return root1;
ListNode *mergeRoot = nullptr;
if (root1->m_value < root2->m_value)
{
mergeRoot = root1;
mergeRoot->m_next = Merge(root1->m_next, root2);
}
else
{
mergeRoot = root2;
mergeRoot->m_next = Merge(root1, root2->m_next);
}
return mergeRoot;
}
int main()
{
int arr1[] = { 1, 3, 5, 7, 9 };
int arr2[] = { 2, 4, 6, 8 };
ListNode *root1 = CreateNode(arr1, 5);
ListNode *root2 = CreateNode(arr2, 4);
ListNode *root = Merge(root1, root2);
DeleteAllNode(root);
return 0;
}