LeetCode 21 Merge Two Sorted Lists
2018-03-14 08:24
447 查看
LeetCode 21 Merge Two Sorted Lists
Description
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.代码
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
ListNode *ans = new ListNode(0);
ListNode *ret = ans;
if (l1->val < l2->val) {
ans->val = l1->val;
l1 = l1->next;
} else {
ans->val = l2->val;
l2 = l2->next;
}
while (l1 != NULL || l2 != NULL) {
if (l2 == NULL || l1 && l2 && l1->val < l2->val) {
ans->next = new ListNode(l1->val);
l1 = l1->next;
} else {
ans->next = new ListNode(l2->val);
l2 = l2->next;
}
ans = ans->next;
}
return ret;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [Leetcode题目]21. Merge Two Sorted Lists
- LeetCode-21-Merge-Two-Sorted-Lists 递归水题
- LeetCode-21. Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- (Java)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++版）
- [C++]LeetCode 21: Merge Two Sorted Lists（合并链表）
- LeetCode(21)题解:Merge Two Sorted Lists
- LeetCode-21. Merge Two Sorted Lists
- 【leetcode 21】javascript 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 合并有序链表