LeetCode 21. 合并两个有序链表

将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

输入：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() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode res = null;
        ListNode cur = null;
        ListNode temp = null;
        
        if(null == l1){
            return l2;
        }
        if(null == l2){
            return l1;
        }
        while(null != l1 && null != l2){
                if(l1.val <= l2.val){
                    temp = new ListNode(l1.val);
                    l1 = l1.next;
                }else{
                    temp = new ListNode(l2.val);
                    l2 = l2.next;
                }
                
                if(cur == null){
                    res = temp;
                    cur = temp;
                }else{
                    cur.next = temp;
                    cur = temp;
                }
        }
        
        if(null != l1){
            cur.next = l1;
        }

        if(null != l2){
            cur.next = l2;
        }
        
        return  res;
    }
}

方法二: 迭代法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
       ListNode res = new ListNode();
        ListNode cur = res;
        while(null != l1 && null != l2){
            if(l1.val <= l2.val){
                cur.next = l1;
                l1 = l1.next;
            }else{
                cur.next = l2;
                l2 = l2.next;
            }
            
            cur = cur.next;
        }

        if(null != l1){
            cur.next = l1;
        }

        if(null != l2){
            cur.next = l2;
        }

        return res.next;
    }
}

方法三: 递归法

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(null == l1 || null == l2){
            return l1 == null ? l2 : l1;
        }
        
        if(l1.val <= l2.val){
            l1.next = mergeTwoLists(l1.next, l2);
            return l1;
        }else{
            l2.next = mergeTwoLists(l1, l2.next);
            return l2;
        }
    }
}