合并两个排序链表

最新推荐文章于 2024-02-07 14:30:00 发布

gzvincentlee

最新推荐文章于 2024-02-07 14:30:00 发布

阅读量302

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/gzvincentlee/article/details/48930769

版权

剑指offer 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

将两个排序链表合并为一个新的排序链表

样例

给出 1->3->8->11->15->null，2->null，返回1->2->3->8->11->15->null。

解法1：

public class Solution {
    /**
     * @param ListNode l1 is the head of the linked list
     * @param ListNode l2 is the head of the linked list
     * @return: ListNode head of linked list
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // write your code here
        if(l1 == null){
            return l2;
        }else if(l2 == null){
            return l1;
        }
        ListNode mergedList = new ListNode(0);
        if(l1.val < l2.val){
            mergedList = l1;
            mergedList.next = mergeTwoLists(l1.next,l2);
        }else{
            mergedList = l2;
            mergedList.next = mergeTwoLists(l1,l2.next);
        }
        return mergedList;
    }
}

解法2：

public class Solution {
    /**
     * @param ListNode l1 is the head of the linked list
     * @param ListNode l2 is the head of the linked list
     * @return: ListNode head of linked list
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // write your code here
        ListNode mergedList = new ListNode(0);
        ListNode runner = mergedList;
        while(l1!=null && l2!=null){
            if(l1.val < l2.val){
                runner.next = l1;
                l1 = l1.next;
            }else{
                runner.next = l2;
                l2 = l2.next;
            }
            runner = runner.next;
        }
        if(l1!=null){
            runner.next = l1;
        }
        if(l2!=null){
            runner.next = l2;
        }
        return mergedList.next;
    }
}