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.
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode newList = new ListNode(0);
ListNode p = newList;
if (l1 == null){
return l2;
}
else if (l2 == null){
return l1;
}
while (l1 != null || l2!= null){
if (l1 == null){
p.next = new ListNode(l2.val);
l2 = l2.next;
}
else if (l2 == null){
p.next = new ListNode(l1.val);
l1 = l1.next;
}
else {
if (l1.val < l2.val){
p.next = new ListNode(l1.val);
l1 = l1.next;
}
else {
p.next = new ListNode(l2.val);
l2 = l2.next;
}
}
p = p.next;
}
return newList.next;
}
}