LeetCode-Easy刷题(6) Merge Two Sorted Lists
2017-11-27 20:14
405 查看
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.
合并两个排序链表,并将其作为一个新列表返回。新的列表应该通过将前两个列表的节点拼接在一起。
合并两个排序链表,并将其作为一个新列表返回。新的列表应该通过将前两个列表的节点拼接在一起。
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode helper = new ListNode(0);//始终是总表的头部 ListNode pre = helper;//指针控制向前插入 相对参考系l1 pre.next = l1; while(l1!=null && l2!=null){ if(l1.val>l2.val){ //将l2最前面节点解耦插入链表移动位置指针后 ListNode next = l2.next; l2.next = pre.next; pre.next = l2; l2 = next; }else{ l1 = l1.next;//移动参考系指针 } pre = pre.next; } if(l2 !=null){ pre.next = l2; } return helper.next; } class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
相关文章推荐
- LeetCode 21. Merge Two Sorted Lists (Easy)
- 【Leetcode】【Easy】Merge Two Sorted Lists
- 【LeetCode-easy】Merge Two Sorted Lists
- LeetCode_Easy心得:21. Merge Two Sorted Lists(C语言)
- LeetCode:21_Merge Two Sorted Lists | 合并两个排序列表 | Easy
- 【leetcode】Merge Two Sorted Lists(easy)
- LeetCode刷题(C++)——Merge Two Sorted Lists(Easy)
- 【Leetcode】【Easy】Merge Two Sorted Lists .
- Leetcode 21. Merge Two Sorted Lists (Easy) (cpp)
- LeetCode-21-Merge Two Sorted Lists(链表/归并)-Easy
- 【Leetcode-Easy-21】Merge Two Sorted Lists
- [Leetcode 21, Easy] Merge Two Sorted Lists
- [LeetCode] 021. Merge Two Sorted Lists (Easy) (C++/Python)
- # 蜗牛慢慢爬 LeetCode 21. Merge Two Sorted Lists [Difficulty: Easy]
- LeetCode-21-Merge Two Sorted Lists(C语言实现)
- leetcode 21-Merge Two Sorted Lists
- LeetCode-Merge Two Sorted Lists
- 【Leetcode】【python】Merge Two Sorted Lists
- LeetCode 21 Merge Two Sorted Lists
- LeetCode:Merge Two Sorted Lists