将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
-
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
/**
* 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) {
if(l1 == null && l2 == null) return null;
if(l1 == null) return l2;
if(l2 == null) return l1;
if(l1.val > l2.val){
l2.next = mergeTwoLists(l1, l2.next);
return l2;
} else{
l1.next = mergeTwoLists(l1.next, l2);
return l1;
}
}
}
//迭代
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode head = new ListNode(-1);
ListNode prev = head;
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;
}
prev.next = l1 == null ? l2 : l1;
return head.next;
}
执行用时 : 1 ms, 在Merge Two Sorted Lists的Java提交中击败了99.86% 的用户
内存消耗 : 34.8 MB, 在Merge Two Sorted Lists的Java提交中击败了96.22% 的用户