Java [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.

解題思路：

題目的意思是將兩個有序鏈表合成一個有序鏈表。

逐個比較加入到新的鏈表即可。

代碼如下：

public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {ListNode list = new ListNode(0);ListNode tmp = list;while (l1 != null || l2 != null) {if (l1 == null) {tmp.next = new ListNode(l2.val);l2 = l2.next;} else if (l2 == null) {tmp.next = new ListNode(l1.val);l1 = l1.next;} else {if (l1.val < l2.val) {tmp.next = new ListNode(l1.val);l1 = l1.next;} else {tmp.next = new ListNode(l2.val);l2 = l2.next;}}tmp = tmp.next;}return list.next;}

 

 

Java [leetcode 21]Merge Two Sorted Lists