-
Notifications
You must be signed in to change notification settings - Fork 0
/
21.合并两个有序链表.cpp
44 lines (36 loc) · 977 Bytes
/
21.合并两个有序链表.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
38
39
40
41
42
43
/*
* @lc app=leetcode.cn id=21 lang=cpp
*
* [21] 合并两个有序链表
*/
// @lc code=start
/**
* 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* l1, ListNode* l2) {
ListNode * head = new ListNode(0);
ListNode * p = head;
while (l1 != NULL && l2 != NULL){
if (l1->val <= l2->val) p->next = l1, l1 = l1->next;
else {
p->next = l2;
l2 = l2->next;
}
p = p->next;
}
// 把剩下的链给接上
if (l1 != NULL) p->next = l1;
if (l2 != NULL) p->next = l2;
return head->next; // 返回不带头节点的 链表;
}
};
// @lc code=end