题目描述:
将两个有序的链表合并为一个新链表,要求新的链表是通过拼接两个链表的节点来生成的。
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null)
return l2;
if(l2 == null)
return l1;
ListNode p1 = l1;
ListNode p2 = l2;
ListNode head = new ListNode(0);
ListNode p = head;
while(p1 != null && p2 != null){
if(p1.val<p2.val){
p.next = p1;
p = p.next;
p1 = p1.next;
}
else{
p.next = p2;
p = p.next;
p2 = p2.next;
}
}
if(p1 == null){
p.next = p2;
}
else{
p.next = p1;
}
return head.next;
}
}