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

思路一：

class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2) {
         ListNode head = new ListNode(-1);
        ListNode cur =head;
        while (list1!=null&&list2!=null){
            if (list1.val<=list2.val){
                cur.next=list1;
                list1=list1.next;
            }else {
                cur.next=list2;
                list2=list2.next;
            }
            cur=cur.next;
        }
        if (list1!=null) cur.next=list1;
        if (list2!=null) cur.next=list2;
        return head.next;
    }
}

思路二就是递归

class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}
public class HeBingLianBiao {
    public 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
           return list1;
       }else{
           list2.next=Merge(list2.next,list1);
           return list2;
       }
    }
}

递归总结一句话：

出龟看栈顶，回龟看栈底，递归看参数，一定要return