题目
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
/*
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 && list2 == null) return null;
if(list1 == null) return list2;
if(list2 == null) return list1;
//resultList是头结点, list用来存放合并后的list1,2(需要记住头结点,所以在list上操作);
ListNode resultList = new ListNode(0);
ListNode list = resultList;
while(list1 != null && list2 != null){
if(list1.val <= list2.val){
list.next = list1;
list1 = list1.next;
list = list.next;
}
else{
list.next = list2;
list2 = list2.next;
list = list.next;
}
}
while(list1 != null){
list.next = list1;
list1 = list1.next;
list = list.next;
}
while(list2 != null){
list.next = list2;
list2 = list2.next;
list = list.next;
}
//返回头结点下一个结点
return resultList.next;
/*递归
ListNode list = null;
if(list1.val<list2.val){
list = list1;
list.next = Merge(list1.next,list2);
}else{
list = list2;
list.next = Merge(list1,list2.next);
}
return list;
*/
}
}