剑指Offer(牛客网)-合并两个排序的链表

题目来源：

https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述：

输入两个单调递增的链表，输出两个链表合成后的链表，当然我们需要合成后的链表满足单调不减规则。

代码如下：

/*
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 = new ListNode(-1);
		ListNode newTail = newHead;
		while (list1 != null && list2 != null) {
			if (list1.val <= list2.val) {
				newTail.next = list1;
				list1 = list1.next;
			} else {
				newTail.next = list2;
				list2 = list2.next;
			}
			newTail = newTail.next;
		}
		newTail.next = list1 == null ? list2 : list1;
		return newHead.next;
	}
}