6.2 Merge Two Sorted Lists
2014-07-18 02:46
190 查看
原题链接:https://oj.leetcode.com/problems/merge-two-sorted-lists/
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.
我的思路:可以再create一个新的链表,作为返回结果吗?可以。如果不行,该怎么做?
Time: O(min(m, n)), Space: O(1)
@8.30.2014 已做第二遍。不用再做。
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.
我的思路:可以再create一个新的链表,作为返回结果吗?可以。如果不行,该怎么做?
Time: O(min(m, n)), Space: O(1)
public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode prev = new ListNode(0);//the result list prev.next = null; ListNode temp = prev; while(l1!=null && l2!=null){ if(l1.val < l2.val){ prev.next = l1; l1 = l1.next; } else{ prev.next = l2; l2 = l2.next; } prev = prev.next; } if(l1!=null) prev.next = l1;//当两链表之一还有剩余时,只需把当前prev.next指向头节点,不用再逐个遍历剩下节点。因此时间复杂度是O(min(m,n)) else prev.next = l2; return temp.next; } }
@8.30.2014 已做第二遍。不用再做。
相关文章推荐
- 6.2—排序—Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists
- LeetCode | Merge Two Sorted Lists
- Merge Two Sorted Lists
- 【leetcode】Merge Two Sorted Lists
- Merge Two Sorted Lists
- [Leetcode]Merge Two Sorted Lists
- LeetCode题解——Merge Two Sorted Lists
- Merge Two Sorted Lists
- 2017-09-11 LeetCode_021 Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- Merge Two Sorted Lists[LEETCODE]
- [Leetcode] Merge Two Sorted Lists
- ( Leetcode 21 ) Merge Two Sorted Lists
- Leetcode 21. Merge Two Sorted Lists
- Merge Two Sorted Lists
- leetcode: (21) Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- LeetCode Merge Two Sorted Lists
- Merge Two Sorted Lists