LeetCode21——Merge Two Sorted Lists
2015-02-11 17:19
369 查看
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.
容易
难度系数:
容易
实现
[code]ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { ListNode *newnode = NULL; ListNode *node1 = NULL; ListNode *node2 = NULL; if (l1 == NULL) return l2; else if (l2 == NULL) return l1; else if (l1->val > l2->val) { newnode = l2; node1 = l1; node2 = l2->next; } else { newnode = l1; node1 = l1->next; node2 = l2; } ListNode *node = newnode; while (true) { if (node1 == NULL) { node->next = node2; break; } if (node2 == NULL) { node->next = node1; break; } if (node1->val > node2->val) { node->next = node2; node2 = node2->next; } else { node->next = node1; node1 = node1->next; } node = node->next; } return newnode; }
相关文章推荐
- 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
- [LeetCode21]Merge Two Sorted Lists(合并两个有序链表)
- LeetCode之21----Merge Two Sorted Lists
- [LeetCode]21. Merge Two Sorted Lists
- 【Leetcode-Easy-21】Merge Two Sorted Lists
- leetcode-21 Merge Two Sorted Lists
- 面试题17:合并两个有序链表(Leetcode-21:Merge Two Sorted Lists)
- LeetCode 21 Merge Two Sorted Lists
- [leetcode:python]21.Merge Two Sorted Lists
- leetcode-21Merge Two Sorted Lists
- LeetCode 21 — Merge Two Sorted Lists(C++ Java Python)
- [Leetcode]21. Merge Two Sorted Lists
- LeetCode21 Merge Two Sorted Lists
- LeetCode(21)Merge Two Sorted Lists