-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeTwoSortedLists.h
More file actions
43 lines (38 loc) · 1.02 KB
/
MergeTwoSortedLists.h
File metadata and controls
43 lines (38 loc) · 1.02 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
/**************************************
* Author : luoshikai
* Version : 1.0
* Date : 2013-10-13
* Email : [email protected]
*************************************/
/**************************************
* Merge two sorted linked lists and return it as a new list. The new list
* should be made by splicing together the nodes of the first two lists.
*************************************/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2)
{
if (l1 == NULL) return l2;
if (l2 == NULL) return l1;
ListNode *res = NULL;
if (l1->val < l2->val)
{
res = l1;
res->next = mergeTwoLists(l1->next, l2);
}
else
{
res = l2;
res->next = mergeTwoLists(l1, l2->next);
}
return res;
}
};