输入两个单调递增的链表,返回两个链表合成后的递增链表
/*
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 head = new ListNode(0), temp = head;
while(list1 != null && list2 != null){
if(list1.val >= list2.val){
temp.next = new ListNode(list2.val);
list2 = list2.next;
}
else {
temp.next = new ListNode(list1.val);
list1 = list1.next;
}
temp = temp.next;
}
while(list1 != null) {
temp.next = new ListNode(list1.val);
list1 = list1.next;
temp = temp.next;
}
while(list2 != null) {
temp.next = new ListNode(list2.val);
list2 = list2.next;
temp = temp.next;
}
return head.next;
}
}