输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
- 主要思想:比较 + 合并~
/*
/*
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 = null;
if (list1 != null && list2 != null) {
if (list1.val > list2.val) {
head = list2;
list2 = list2.next;
} else {
head = list1;
list1 = list1.next;
}
} else {
if (list1 == null) {
return list2;
}
if (list2 == null) {
return list1;
}
}
ListNode result = head;
while (list1 != null && list2 != null) {
if (list1.val < list2.val) {
result.next = list1;
result = list1;
list1 = list1.next;
} else {
result.next = list2;
result = list2;
list2 = list2.next;
}
}
if (list1 != null) {
result.next = list1;
}
if (list2 != null) {
result.next = list2;
}
return head;
}
}