合并两个排序的链表

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

/*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 start = new ListNode(0);        ListNode head = start;        ListNode cur1 = list1;        ListNode cur2 = list2;        while (cur1 != null && cur2 != null) {            if (cur1.val < cur2.val) {                start.next = cur1;                cur1 = cur1.next;            } else {                start.next = cur2;                cur2 = cur2.next;            }            start = start.next;        }        while (cur1 != null) {            start.next = cur1;            cur1 = cur1.next;            start = start.next;        }        while (cur2 != null) {            start.next = cur2;            cur2 = cur2.next;            start = start.next;        }        return head.next;    }}