题目
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
例子
Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4
代码
/**
* 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 merged=null;
ListNode head=null;
while(l1!=null&&l2!=null){
if(head==null){
if(l1.val<l2.val){
merged=l1;
l1=l1.next;
}else{
merged=l2;
l2=l2.next;
}
head=merged;
continue;
}
if(l1.val<l2.val){
merged.next=l1;
l1=l1.next;
}else{
merged.next=l2;
l2=l2.next;
}
merged=merged.next;
}
while(l1!=null){
merged.next=l1;
l1=l1.next;
merged=merged.next;
}
while(l2!=null){
merged.next=l2;
l2=l2.next;
merged=merged.next;
}
return head;
}
}