leetcode_21_Merge Two Sorted Lists
2015-02-03 11:11
387 查看
描述:
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.
思路:
好像是数据结构上面的原题,就不多说了,通过比较把两个链表一起就可以了。需要注意的就是两个链表的head谁当新表的head问题,当然谁小谁当head 了,先比较一下即可。
代码:
结果:
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.
思路:
好像是数据结构上面的原题,就不多说了,通过比较把两个链表一起就可以了。需要注意的就是两个链表的head谁当新表的head问题,当然谁小谁当head 了,先比较一下即可。
代码:
public ListNode mergeTwoLists(ListNode l1, ListNode l2) { if(l1==null) return l2; if(l2==null) return l1; ListNode listNew=null; if(l1.val<l2.val) { listNew=l1; l1=l1.next; } else { listNew=l2; l2=l2.next; } ListNode pListNode=listNew; while(l1!=null&&l2!=null) { if(l1.val<l2.val) { pListNode.next=l1; pListNode=l1; l1=l1.next; } else { pListNode.next=l2; pListNode=l2; l2=l2.next; } } if(l1!=null) pListNode.next=l1; if(l2!=null) pListNode.next=l2; return listNew; }
结果:
相关文章推荐
- [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
- LeetCodet题解--21. Merge Two Sorted Lists(合并两个排序好的链表)
- 【LeetCode 21】Merge Two Sorted Lists(Python)
- LeetCode 21 Merge Two Sorted Lists
- leetcode 21:Merge Two Sorted Lists(15-10-9)
- leetcode21 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
- 面试题17:合并两个有序链表(Leetcode-21:Merge Two Sorted Lists)
- LeetCode 21 Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- Leetcode 21. Merge Two Sorted Lists