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