Merge two sorted linked lists and return it as a new sorted list.
The new list should be made by splicing together the nodes of the first two lists.
#region LeetCode 21 Merge Two Sorted Lists
/*
* Merge two sorted linked lists and return it as a new sorted list.
* The new list should be made by splicing together the nodes of the first two lists.
*
* Input : l1=[1,2,4], l2=[1,3,4]
* Output : [1,1,2,3,4,4]
*/
public class ListNode
{
public int val;
public ListNode next;
public ListNode(int val=0, ListNode next = null)
{
this.val = val;
this.next = next;
}
}
public ListNode LeetCode_21(ListNode l1, ListNode l2)
{
ListNode ans = new ListNode(-1);
ListNode cur = ans;
int a = 0;
while (l1 != null && l2 != null)
{
if(l1.val < l2.val)
{
cur.next = l1;
l1 = l1.next;
}
else
{
cur.next = l2;
l2 = l2.next;
}
cur = cur.next;
}
if (l1 != null)
cur.next = l1;
else
cur.next = l2;
return ans.next;
}
#endregion