题目描述
输入两个单调递增的链表,输出两个链表合成后的链表,当然我们需要合成后的链表满足单调不减规则。
class Solution16 {
public ListNode Merge(ListNode list1, ListNode list2) {
// 递归
if (list1 == null) {
return list2;
}
if (list2 == null) {
return list1;
}
if (list1.val <= list2.val) {
list1.next = Merge(list1.next, list2);
return list1;
} else {
list2.next = Merge(list1, list2.next);
return list2;
}
}
public ListNode Merge1(ListNode list1, ListNode list2) {
if (list1 == null) {
return list2;
}
if (list2 == null) {
return list1;
}
ListNode mergeHead = null;
ListNode current = null;
while (list1 != null && list2 != null) {
if (list1.val <= list2.val) {
if (mergeHead == null) {
mergeHead = current = list1;
} else {
current.next = list1;
current = current.next;
}
list1 = list1.next;
} else {
if (mergeHead == null) {
mergeHead = current = list2;
} else {
current.next = list2;
current = current.next;
}
list2 = list2.next;
}
}
if (list1 == null) {
current.next = list2;
} else {
current.next = list1;
}
return mergeHead;
}
}
public class TestDemo16 {
public static void main(String[] args) {
ListNode head = new ListNode(1);
ListNode one = new ListNode(4);
ListNode two = new ListNode(7);
ListNode three = new ListNode(10);
head.next = one;
one.next = two;
two.next = three;
ListNode head1 = new ListNode(2);
ListNode one1 = new ListNode(5);
ListNode two1 = new ListNode(8);
ListNode three1 = new ListNode(12);
head1.next = one1;
one1.next = two1;
two1.next = three1;
Solution16 sol = new Solution16();
ListNode result = sol.Merge(head, head1);
while (result != null) {
System.out.println("->" + result);
result = result.next;
}
}
}