Leetcode----------Merge Sorted Lists

Topic	Merge Sorted Lists
Pass Rate	33.2%
Difficulty	Easy

Merge sorted linked lists and return it as a new list. The new list should is made by splicing together the nodes of the first of the lists.

Key: Define a new pointer and then take the first element of the two linked list to compare, adding the smaller to the new list. Finally, when one of the linked lists becomes empty, all remaining elements of the other list are added to the new linked list.

Java code:

/*** Definition for singly-linked list. * public class ListNode {* int val; * ListNode Next; * ListNode (int X) {* val = x; * next = NULL; *} *}*/ Public classSolution { PublicListNode mergetwolists (listnode L1, ListNode L2) {ListNode P1=L1; ListNode P2=L2; ListNode mergedlist=NewListNode (0); ListNode P=mergedlist;  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; }        returnMergedlist.next; }}

Leetcode----------Merge Sorted Lists