將兩個(gè)有序鏈表合并為一個(gè)新的有序鏈表并返回。新鏈表是通過(guò)拼接給定的兩個(gè)鏈表的所有節(jié)點(diǎn)組成的。?

示例：

輸入：1->2->4, 1->3->4 輸出：1->1->2->3->4->4 /*** Definition for singly-linked list.* public class ListNode {* int val;* ListNode next;* ListNode(int x) { val = x; }* }*/// 方法一：遞歸方式public static ListNode mergeTwoLists1(ListNode l1, ListNode l2) {ListNode result = null;if (l1 == null) {return l2;}if (l2 == null) {return l1;}if (l1.val <= l2.val) {result = l1;result.next = mergeTwoLists1(l1.next, l2); // 遞歸} else {result = l2;result.next = mergeTwoLists1(l1, l2.next);}return result;}// 方法二：非遞歸方式public static ListNode mergeTwoLists2(ListNode l1, ListNode l2) {if (l1 == null) {return l2;}if (l2 == null) {return l1;}ListNode mergeNode = null;if (l1.val <= l2.val) {mergeNode = l1;l1 = l1.next;} else {mergeNode = l2;l2 = l2.next;}ListNode temp = mergeNode;while (l1 != null && l2 != null) {if (l1.val <= l2.val) {temp.next = l1;l1 = l1.next;} else {temp.next = l2;l2 = l2.next;}temp = temp.next;}if (l1 != null) {temp.next = l1;}if (l2 != null) {temp.next = l2;}return mergeNode;}

?

總結(jié)

以上是生活随笔為你收集整理的【算法系列之七】合并两个有序链表的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。