leetcode
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出: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&&l2!=null){
return l2;
}
else if(l1!=null&&l2==null)
return l1;
else if(l1==null&&l2==null) return null;
ListNode head;
ListNode curr;
if(l1.val<l2.val) {
head=new ListNode(l1.val);
l1=l1.next;
}
else {
head=new ListNode(l2.val);
l2=l2.next;
}
curr=head;
while(l1!=null&&l2!=null){
if(l1.val<l2.val){
curr.next=new ListNode(l1.val);
l1=l1.next;
curr=curr.next;
}
else {
curr.next=new ListNode(l2.val);
l2=l2.next;
curr=curr.next;
}
}
if(l1==null&&l2!=null) {
while(l2!=null){
curr.next =new ListNode(l2.val);
l2=l2.next;
curr=curr.next;
}
}
else if(l2==null&&l1!=null) {
while(l1!=null){
curr.next =new ListNode(l1.val);
l1=l1.next;
curr=curr.next;
}
}
return head;
}
}