题目
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
限制:
0 <= 链表长度 <= 1000
题解
两个链表都配置一个游标,分别比较插入到新链表中。
/**
* 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) return l2;
if(l2 == null) return l1;
ListNode head = new ListNode(0);
ListNode p = l1, q = l2, t = head;
while(l1 != null && l2 != null ){
if(p.val < q.val){
l1 = l1.next;
t.next = p;
t = t.next;
p = l1;
}
else{
l2 = l2.next;
t.next = q;
t = t.next;
q = l2;
}
}
if(l1 != null)
t.next = l1;
else
t.next = l2;
return head.next;
}
}