剑指Offer：合并2个排序的链表

最新推荐文章于 2022-04-09 20:59:46 发布

Fly_TheWind

最新推荐文章于 2022-04-09 20:59:46 发布

阅读量264

点赞数

分类专栏：剑指Offer 数据结构链表文章标签：合并剑指offer 链表

本文链接：https://blog.csdn.net/Fly_TheWind/article/details/51517236

版权

数据结构同时被 3 个专栏收录

10 篇文章 0 订阅

订阅专栏

剑指Offer

9 篇文章 0 订阅

订阅专栏

链表

4 篇文章 0 订阅

订阅专栏

方法一：

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2) {
        if(list1 == null)return list2;
        if(list2 == null)return list1;
        
        ListNode newhead = null;
        ListNode another = null;
        if( list1.val < list2.val ){
            newhead = list1;
            list1 = list1.next;
        }else{
            newhead = list2;
            list2 = list2.next;
        }
        ListNode tmp = newhead;
        while(  list1!= null && list2 != null ){
            if( list1.val < list2.val )
            {
                tmp.next = list1;
               	tmp = tmp.next;
                list1 = list1.next;
            }else
            {
                tmp.next = list2;
                tmp = tmp.next;
                list2 = list2.next;
            }
        }
		if(list1 == null && list2 != null){
            tmp.next = list2;
        }
        if(list2 == null && list1 != null){
            tmp.next = list1;
        }
        
        return newhead;
    }
}

方式2 ：是用函数递归的方式。

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2) {
        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;
    }
}