JZ16 合并两个排序的列表

采用假头+双指针法，但是需要注意当遍历完了至少一个list以后的情况（即post-processing）。代码如下：

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

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode Merge(ListNode list1,ListNode list2) {
        ListNode fakeHead = new ListNode(0);
        ListNode curr = fakeHead;
        while(list1 != null && list2 != null){
            if(list1.val <= list2.val){
                curr.next = list1;
                curr = curr.next;
                list1 = list1.next;
            }else{
                curr.next = list2;
                curr = curr.next;
                list2 = list2.next;
            }
        }
        // We have run out of at least one linkedlist
        if(list1 != null){
            curr.next = list1;
        }else if(list2 != null){
            curr.next = list2;
        }
        return fakeHead.next;
    }
}