using the single linked list code written in the class or in

using the single linked list code written in the class or in the lab, write and test the follow, function: Merge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order.

Solution

public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode head = new ListNode(0); ListNode p=head; ListNode p1=l1; ListNode p2=l2; while(p1!=null && p2!=null){ if(p1.val < p2.val){ p.next = p1; p1 = p1.next; }else{ p.next = p2; p2 = p2.next; } p=p.next; } if(p1!=null){ p.next = p1; } if(p2!=null){ p.next = p2; } return head.next; }