LeetCode 21. Merge Two Sorted Lists

分析

難度：易

題目

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.

Example:

Input: 1->2->4, 1->3->4

Output: 1->1->2->3->4->4

解答

package LeetCode;public class L21_MergeTwoSortedLists {public ListNode mergeTwoLists(ListNode l1, ListNode l2) {ListNode temp=new ListNode(0);//指示當前節點ListNode ln=temp;//ln為鏈表頭部，返回的鏈表頭部加入了一個節點。while(l1!=null &&l2!=null){if(l1.val>l2.val){temp.next=l2;l2=l2.next;}else{temp.next=l1;l1=l1.next;}temp=temp.next;//注意鏈表上的移動，}if(l1!=null){temp.next=l1;}else{temp.next=l2;}return ln.next;}
}

?

?