AC
/**
* 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 begin;
if(l1.val <= l2.val){
begin = l1;
l1 = l1.next;
}else{
begin = l2;
l2 = l2.next;
}
ListNode p = begin;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
p.next = l1;
p = p.next;
l1 = l1.next;
}else{
p.next = l2;
p = p.next;
l2 = l2.next;
}
}
if(l1!=null) p.next = l1;
if(l2!=null) p.next = l2;
return begin;
}
}