剑指offer题15

package jianzhioffer;

import jianzhioffer.LinkList;
/**
 * 输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。
 *
 */
//节点类
/*class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
*/

public class Solution15 {

/*	public static ListNode Merge(ListNode list1,ListNode list2) {  //递归方式
        if(list1 == null){
        	return list2;
        }
        if(list2 == null){
        	return list1;
        }
        if(list1.val <= list2.val){
        	list1.next = Merge(list1.next,list2);
        	return list1;
        }else{
        	list2.next = Merge(list1,list2.next);
        	return list2;
        } 
    }*/
	
	public static ListNode Merge(ListNode list1,ListNode list2) { //非递归方式
		if(list1 == null){
            return list2;
        }
        if(list2 == null){
            return list1;
        }
        //定义合并节点
        ListNode mergeHead = null;
        ListNode current = null;      
        while(list1!=null && list2!=null){
            if(list1.val <= list2.val){
                if(mergeHead == null){
                   mergeHead = current = list1;
                }else{
                   current.next = list1;
                   current = current.next;
                }
                list1 = list1.next;
            }else{
                if(mergeHead == null){
                   mergeHead = current = list2;
                }else{
                   current.next = list2;
                   current = current.next;
                }
                list2 = list2.next;
            }
        }
        
        //把未结束的链表连接到合并后的链表尾部
        if(list1 == null){
            current.next = list2;
        }else{
            current.next = list1;
        }
        
        return mergeHead;
	}
	

	public static void main(String[] args) {
		LinkList list1 = new LinkList();  
		list1.addFirstNode(10);
		list1.addFirstNode(9);
		list1.addFirstNode(8);
		//8,9,10
		list1.add(0, 7);
		list1.add(4, 20);
		list1.add(5, 66);
		//7,8,9,10,20,66
		list1.displayAllNodes();
		
		LinkList list2 = new LinkList();  
		list2.addFirstNode(3);
		list2.addFirstNode(2);
		list2.addFirstNode(1);
		//1,2,3
		list2.add(3, 10);
		list2.add(4, 15);
		list2.add(5, 50);
		//1,2,3,10,15,50
		list2.displayAllNodes();
		
		ListNode listnode = Merge(list1.findByPos(0),list2.findByPos(0));
		

	}

}