鏈接：https://leetcode.com/problems/merge-two-sorted-lists/#/description
難度：Easy
題目：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.
翻譯：合并兩個(gè)排好序的鏈列，并將其作為新鏈表返回龄糊。新鏈表應(yīng)通過(guò)將前兩個(gè)列表的節(jié)點(diǎn)拼接在一起。
思路一：新建一個(gè)頭指針指向0的臨時(shí)鏈表，比較l1和l2的當(dāng)前值的大小挥吵，把臨時(shí)鏈表的next節(jié)點(diǎn)指向較小的節(jié)點(diǎn)，l1或者l2的指針后移一位花椭，依次往下忽匈，直到l1或者l2為空，則把臨時(shí)鏈表的next節(jié)點(diǎn)指向最后那段非空的鏈表矿辽，返回臨時(shí)鏈表的第二個(gè)節(jié)點(diǎn)（頭一個(gè)節(jié)點(diǎn)為0）丹允。
參考代碼一（Java）
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode newList = new ListNode(0);
ListNode nextList = newList;
while(l1 != null && l2 != null){
if(l1.val < l2.val){
nextList.next = l1;
l1 = l1.next;
}else{
nextList.next = l2;
l2 = l2.next;
}
nextList = nextList.next;
}
if(l1 != null){
nextList.next = l1;
}else{
nextList.next = l2;
}
return newList.next;
}
}
思路二：使用遞歸法。構(gòu)造一個(gè)臨時(shí)鏈表袋倔，當(dāng)l1當(dāng)前節(jié)點(diǎn)的值大于l2當(dāng)前節(jié)點(diǎn)的值時(shí)雕蔽，我們把l2這個(gè)較小的值賦給臨時(shí)鏈表的下一個(gè)節(jié)點(diǎn)，并將l2的下一個(gè)節(jié)點(diǎn)的值和l1當(dāng)前節(jié)點(diǎn)的值放到下一次做對(duì)比宾娜，依次遞歸下去批狐。
參考代碼二（Java）
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) return l2;
if (l2 == null) return l1;
if (l1.val > l2.val) {
ListNode tmp = l2;
tmp.next = mergeTwoLists(l1, l2.next);
return tmp;
} else {
ListNode tmp = l1;
tmp.next = mergeTwoLists(l1.next, l2);
return tmp;
}
}
}
