将两个有序链表合称为一个有序链表。
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode l3(INT_MIN);
ListNode* tail = &l3;
while (l1 && l2) {
if (l1->val < l2->val) {
tail->next = l1;
l1 = l1->next;
}else{
tail->next = l2;
l2 = l2->next;
}
tail = tail->next;
}
tail->next = l1 ? l1 : l2;
return l3.next;
}
};
**21. Merge Two Sorted Lists **Merge two sorted linked li...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
21. Merge Two Sorted Lists Merge two sorted linked lists ...
D121 21. Merge Two Sorted Lists 题目链接 21. Merge Two Sorted...
21. Merge Two Sorted Lists Description Merge two sorted l...
题目链接：https://leetcode-cn.com/problems/merge-two-sorted-li...
题目链接：https://leetcode-cn.com/problems/merge-two-sorted-li...
LeetCode 21.Merge Two Sorted Lists Merge two sorted linke...
本文标题：LeetCode 21. Merge Two Sorted Li
本文链接：https://www.haomeiwen.com/subject/wlsxzxtx.html
网友评论