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.
if... else if不要偷懒直接写 if...if...
|
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 |
/** * 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) { ListNode *head = NULL,*temp = head; if(l1 == NULL && l2 == NULL)return
NULL; if(l1 == NULL && l2 != NULL)return
l2; if(l1 != NULL && l2 == NULL)return
l1; while(l1 != NULL && l2 != NULL) { if(l1->val <= l2->val) { if(head == NULL) { head = l1; temp = head; l1 = l1->next; continue; } temp->next = l1; l1 = l1->next; temp = temp->next; } else
if(l1->val > l2->val) { if(head == NULL) { head = l2; temp = head; l2 = l2->next; continue; } temp->next = l2; l2 = l2->next; temp = temp->next; } } if(l1 == NULL)temp ->next = l2; else
if(l2 == NULL) temp ->next =l1; return
head; }}; |
Merge Two Sorted Lists,布布扣,bubuko.com
原文：http://www.cnblogs.com/pengyu2003/p/3572425.html