LeetCode算法入門- Merge Two Sorted Lists -day15

題目描述：

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

題目分析：有點類似于歸并排序，從頭結點開始對比，小的放下去，并且往后移動

Java實現：

/*** Definition for singly-linked list.* public class ListNode {* int val;* ListNode next;* ListNode(int x) { val = x; }* }*/ class Solution {public ListNode mergeTwoLists(ListNode l1, ListNode l2) {if(l1 == null)return l2;if(l2 == null)return l1;ListNode result = new ListNode(0);ListNode temp = result;while(l1 != null && l2 != null){if(l1.val < l2.val){result.next = l1;l1 = l1.next;}else{result.next = l2;l2 = l2.next;}//這一步容易忽略，要將result.next的值付給result，才能遞歸下去result = result.next;}if(l1 != null){result.next = l1;}if(l2 != null){result.next = l2;}return temp.next;} }

總結

以上是生活随笔為你收集整理的LeetCode算法入门- Merge Two Sorted Lists -day15的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。