将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
public class Main {
public static void main(String[] args) {
ListNode l11 = new ListNode(1);
ListNode l12 = new ListNode(2);
ListNode l13 = new ListNode(4);
ListNode l21 = new ListNode(1);
ListNode l22 = new ListNode(3);
ListNode l23 = new ListNode(4);
l11.next = l12;
l12.next = l13;
l21.next = l22;
l22.next = l23;
ListNode m = mergeTwoLists(l11, l21);
System.out.println(m.val);
System.out.println(m.next.val);
System.out.println(m.next.next.val);
}
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode r = new ListNode(0);
ListNode p = r;
while (l1 != null && l2 != null) {
if (l1.val < l2.val) {
p.next = l1;
p = p.next;
l1 = l1.next;
} else {
p.next = l2;
p = p.next;
l2 = l2.next;
}
}
if (l1 == null)
p.next = l2;
if (l2 == null)
p.next = l1;
return r.next;
}
}