【剑指offer】合并两个排序的链表

方法一、递归。递归方法很精巧。

/*
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;
        }
        //只是改变指针指向，两个链表其他不变。而return的每次都是当前链表的头节点。
        if(list1.val <list2.val) {
            list1.next = Merge(list1.next,list2);
            return list1;
        }
        else {
            list2.next = Merge(list1,list2.next);
            return list2;
        }
        
    }
}

方法二、非递归。

搞清楚细节。

public class MergeTwoSortedListnode {

	public static ListNode mergeTwoSortedListnode(ListNode list1, ListNode list2) {
		if (list1 == null) {
			return list2;
		}
		if (list2 == null) {
			return list1;
		}
		ListNode mergeList = null;
		ListNode current = null; // 记录当前指向哪个链表的节点
		// 确定首个节点指向哪
		while (list1 != null && list2 != null) {
			if (list1.val <= list2.val) {
				if (mergeList == null) {
					mergeList =current = list1; // 第一次比较
					
				} else { // 不是第一次比较,这里是难点
					current.next = list1;
					current = current.next;
				}
				list1 = list1.next; // list1前进
			} else {
				if (mergeList == null) {
					mergeList =current = list2;
					
				} else {
					current.next = list2;
					current = current.next;
				}
				list2 = list2.next;
			}
		}
		//剩下的部分
		if(list1 == null) {
			current.next = list2;
		}
		else {
			current.next = list1;
		}
		return mergeList;

	}

	public static void main(String[] args) {

		ListNode list1 = new ListNode(1);
		ListNode list2 = new ListNode(2);
		ListNode n3 = new ListNode(3);
		ListNode n4 = new ListNode(4);
		ListNode n5 = new ListNode(5);
		ListNode n6 = new ListNode(6);
		ListNode n7 = new ListNode(7);
		ListNode n8 = new ListNode(8);
		list1.next = n3;
		n3.next = n5;
		n5.next = n7;
		list2.next = n4;
		n4.next = n6;
		n6.next = n8;
		ListNode listResult = mergeTwoSortedListnode(list1, list2);
		while(listResult!=null) {
			System.out.print (listResult.val + " ");
			listResult = listResult.next;
		}
		
	}

}