Leetcode-21. Merge Two Sorted Lists
2017-03-04 20:49
309 查看
题目
按顺序合并两个排好序的链表，使用原来链表的节点思路
一次循环比较大小即可，最后处理可能剩下的节点代码
class Solution {
public:
ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
ListNode* newList = new ListNode(0);
ListNode *p3 = newList;
while(l1 && l2) {
if(l1->val > l2->val) {
p3->next = l2;
l2 = l2->next;
} else {
p3->next = l1;
l1 = l1->next;
}
p3 = p3->next;
}
if(l1)
p3->next = l1;
else if(l2)
p3->next = l2;
return newList->next;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 21. Merge Two Sorted Lists
- Leetcode 21. Merge Two Sorted Lists
- [Leetcode 21, Easy] Merge Two Sorted Lists
- leetcode 21 Merge Two Sorted Lists
- leetcode21_Merge Two Sorted Lists
- [LeetCode By Python] 21. Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists 将两个已排序的链表合并起来
- leetcode(21). Merge Two Sorted Lists
- Leetcode[21]-Merge Two Sorted Lists
- [leetcode 21] Merge Two Sorted Lists
- leetcode (21) - Merge Two Sorted Lists
- leetcode-21-Merge Two Sorted Lists
- leetcode——21——Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- [Leetcode题目]21. Merge Two Sorted Lists
- Leetcode-21 Merge Two Sorted Lists
- leetcode-21. Merge Two Sorted Lists
- leetcode 21 Merge Two Sorted Lists C++
- leetcode 21 -- Merge Two Sorted Lists
- LeetCode | 21. Merge Two Sorted Lists