题目:
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
Code(JAVA):
public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode preHead = new ListNode(-1);
ListNode prev = preHead;
while (l1 != null && l2 != null) {
if (l1.value <= l2.value) {
prev.next = l1;
l1 = l1.next;
} else {
prev.next = l2;
l2 = l2.next;
}
prev = prev.next;
}
prev.next = l1 == null ? l2 : l1;
return preHead.next;
}
如果对您有所帮助,请关注公众号: