题目:输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
/*
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;
ListNode head = null;
ListNode cur = null;
while(list1!=null && list2!=null){
if(list1.val <= list2.val){
if(head == null)
head = cur = list1;
else{
cur.next = list1;
cur = cur.next;
}
list1 = list1.next;
}
else{//注1
if(head == null)
head = cur = list2;
else{
cur.next = list2;
cur = cur.next;
}
list2 = list2.next;
}
}
if(list1 == null)
cur.next = list2;
else
cur.next = list1;
return head;
}
}
注1:是else,不要写if(list1.val < list2.val)……
笔记:
总之就是良好的代码习惯吧……好心累,不想写这篇了QAQ