难度简单201
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4 输出:
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode n1 = l1;
ListNode n2 = l2;
ListNode head = new ListNode(-1);
ListNode res = head;
while(n1!=null&&n2!=null){
if(n1.val < n2.val){
res.next = new ListNode(n1.val);
n1 = n1.next;
}else{
res.next = new ListNode(n2.val);
n2 = n2.next;
}
res = res.next;
}
if(n1 == null){
res.next = n2;
}else{
res.next = n1;
}
return head.next;
}
}
1->1->2->3->4->4