LeetCode刷题经验总结记录--21. 合并两个有序链表

https://leetcode-cn.com/problems/merge-two-sorted-lists/

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

示例：

输入：l1 = [1,2,4], l2 = [1,3,4]
输出：[1,1,2,3,4,4]

解法：

package leetcode2;

/**
 * 2021/3/10 15:04
 *
 * @Author ayue
 */
public class Solution21 {
    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;
        }
    }
    
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {//迭代
        ListNode node = new ListNode(-1);
        ListNode head = node;
        while (l1 != null && l2 != null) {
            if (l1.val < l2.val) {
                node.next = l1;
                l1 = l1.next;
            } else {
                node.next = l2;
                l2 = l2.next;
            }
            node = node.next;
        }
        node.next = l1 == null ? l2 : l1;
        return head.next;
    }
    
    public ListNode mergeTwoLists2(ListNode l1, ListNode l2) {//递归
        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }
        if (l1.val < l2.val) {
            l1.next = mergeTwoLists2(l1.next, l2);
            return l1;
        } else {
            l2.next = mergeTwoLists2(l1, l2.next);
            return l2;
        }
    }
    
    
    public static void main(String[] args) {
        Solution21 solution21 = new Solution21();
        ListNode l1 = solution21.new ListNode(1);
        ListNode l2 = solution21.new ListNode(1);
        l1.next = solution21.new ListNode(2);
        l1.next.next = solution21.new ListNode(4);
        
        l2.next = solution21.new ListNode(3);
        l2.next.next = solution21.new ListNode(4);
        
        ListNode node = solution21.mergeTwoLists2(l1, l2);
        ListNode cur = node;
        while (cur != null) {
            System.out.println(cur.val);
            cur = cur.next;
        }
    }
}