Leetcode #21 Merge Sorted Lists (E)

[Problem]

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.

[Analysis]

There is nothing to say, that is, order visit and connect the two list node together.

[Solution]

 Public classSolution { PublicListNode mergetwolists (listnode L1, ListNode L2) {ListNode Mergedhead=NewListNode (0); ListNode node=Mergedhead;  while(L1! =NULL&& L2! =NULL) {                                    if(L1.val >l2.val) {Node.next=L2; Node=Node.next; L2=L2.next; } Else{Node.next=L1; Node=Node.next; L1=L1.next; }} Node.next= L1 = =NULL?l2:l1; returnMergedhead.next; }}

Leetcode #21 Merge Sorted Lists (E)