剑指Offer – 合并两个排序的链表

题目描述

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

代码

// 非递归
public ListNode Merge(ListNode list1,ListNode list2) {
    if (list1 == null && list2 == null)
        return null;
    if (list1 == null)
        return list2;
    if (list2 == null)
        return list1;

    ListNode head = null, cur = null;
    while (list1 != null && list2 != null) {
        if (list1.val <= list2.val) {
            if (head == null) {
                head = cur =  list1;
            } else {
                cur.next = list1;
                cur = cur.next;
            }
            list1 = list1.next;
        } else {
            if (head == null) {
                head = cur = list2;
            } else {
                cur.next = list2;
                cur = cur.next;
            }
            list2 = list2.next;
        }
    }

    if (list1 == null)
        cur.next = list2;
    if (list2 == null)
        cur.next = list1;
    return head;
}

//递归
public ListNode Merge(ListNode list1,ListNode list2) {
    if (list1 == null && list2 == null)
        return null;
    if (list1 == null)
        return list2;
    if (list2 == null)
        return list1;

    ListNode head = null;
    if (list1.val <= list2.val) {
        head = list1;
        head.next = Merge(list1.next, list2);
    } else {
        head = list2;
        head.next = Merge(list1, list2.next);
    }
    return head;
}

文章汇总见这里 >>剑指Offer汇总<<

更多精彩文章见这里 >>我的学习小站<< & 更多好玩见这里 >>技术杂谈<<