Leetcode 21 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.
Example:
Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4
1)
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode node = new ListNode(-1);
ListNode list = new ListNode(-1);
list = node;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
node.next = l1;
l1 = l1.next;
}else if(l2.val < l1.val){
node.next = l2;
l2 = l2.next;
}
node = node.next;
}
if(l1 != null){
node.next = l1;
}else if(l2 != null){
node.next = l2;
}
return list.next;
}
}
2)
public ListNode mergeTwoLists(ListNode l1, ListNode l2){
if(l1 == null) return l2;
if(l2 == null) return l1;
if(l1.val < l2.val){
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else{
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}
使用了遞迴的方法
相關文章
- LeetCode 21. Merge Two Sorted ListsLeetCode
- leetcode21_Merge Two Sorted ListsLeetCode
- LeetCode 第 21 題 (Merge Two Sorted Lists)LeetCode
- Leetcode Merge Two Sorted ListsLeetCode
- Leetcode-Merge Two Sorted ListsLeetCode
- Merge Two Sorted Lists leetcode javaLeetCodeJava
- 資料結構與演算法 | Leetcode 21:Merge Two Sorted Lists資料結構演算法LeetCode
- LeetCode Merge Two Sorted Lists(021)解法總結LeetCode
- [LeetCode] Merge Two Sorted Lists 混合插入有序連結串列LeetCode
- Leetcode Merge k Sorted ListsLeetCode
- Leetcode 23 Merge k Sorted ListsLeetCode
- Leetcode-Merge k Sorted ListsLeetCode
- Merge k Sorted Lists leetcode javaLeetCodeJava
- 【Leetcode】23. Merge k Sorted ListsLeetCode
- leetcode23_Merge k Sorted ListsLeetCode
- [LintCode] Merge Two Sorted Lists 混合插入有序連結串列
- [LeetCode] Merge k Sorted Lists 合併k個有序連結串列LeetCode
- Leetcode Merge Sorted ArrayLeetCode
- [leetCode][003] Intersection of Two Linked ListsLeetCode
- Leetcode-Intersection of Two Linked ListsLeetCode
- Fourth. LeetCode 21:MergeTwo Sorted Lists 合併兩個有序連結串列LeetCode
- Leetcode Median of Two Sorted ArraysLeetCode
- Leetcode-Merge Sorted ArrayLeetCode
- Leetcode 4 Median of Two Sorted ArraysLeetCode
- Leetcode-Median of Two Sorted ArraysLeetCode
- Median of Two Sorted Array leetcode javaLeetCodeJava
- Leetcode 160. Intersection of Two Linked ListsLeetCode
- 【Leetcode】160. Intersection of Two Linked ListsLeetCode
- Leetcode 88. Merge Sorted ArrayLeetCode
- LeetCode 之 JavaScript 解答第23題 —— 合併K個有序連結串列(Merge K Sorted Lists)LeetCodeJavaScript
- LeetCode 4. Median of Two Sorted ArraysLeetCode
- LeetCode2:Median of Two Sorted ArraysLeetCode
- 【LeetCode 88_陣列】Merge Sorted ArrayLeetCode陣列
- 【LeetCode】617. Merge Two Binary TreesLeetCode
- LeetCode 617. Merge Two Binary TreesLeetCode
- LeetCode Median of Two Sorted Arrays(004)解法總結LeetCode
- 【Leetcode】167. Two Sum II - Input array is sortedLeetCode
- 【LeetCode從零單排】No.160 Intersection of Two Linked ListsLeetCode