25_剑指offer_合并两个排序的链表

感觉思路很清晰，挨个比较

• 挨个对比，把小的拿过来，接着往下比较。

public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // 思路很明显
        ListNode head = new ListNode(-1);
        ListNode tmp = head;
        while (l1 != null || l2 != null) {
            if (l1 == null) {
                tmp.next = l2;
                break;
            }
            if (l2 == null) {
                tmp.next = l1;
                break;
            }
            // 两个都不空
            if (l1.val < l2.val) {
                tmp.next = l1;
                tmp = l1;
                l1 = l1.next;
            } else {
                tmp.next = l2;
                tmp = l2;
                l2 = l2.next;
            }
        }
        return head.next;
    }
}

用递归的思路

public class Solution {
    /**
     * 这个方法，输入两个头结点，返回一个头结点，是递增的顺序
     *
     * @param l1
     * @param l2
     * @return
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // 用递归的思路来解题
        if (l1 == null) return l2;
        if (l2 == null) return l1;
        // 说明l1和l2都不是空的
        if (l1.val < l2.val) {
            ListNode tmp = l1;
            l1 = l1.next;
            tmp.next = mergeTwoLists(l1, l2);
            return tmp;
        } else {
            ListNode tmp = l2;
            l2 = l2.next;
            tmp.next = mergeTwoLists(l1, l2);
            return tmp;
        }
    }
}