第一种:用循环即可,时间复杂度也是O(n),空间复杂度O(1)
/*
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) {
return list2;
}
if (list2 == null) {
return list1;
}
ListNode cur = new ListNode(-1);
ListNode pre = cur;
while (list1 != null && list2 != null) {
if (list1.val < list2.val) {
cur.next = list1;
list1 = list1.next;
cur = cur.next;
} else if (list1.val > list2.val) {
cur.next = list2;
list2 = list2.next;
cur = cur.next;
} else {
cur.next = list1;
list1 = list1.next;
cur = cur.next;
cur.next = list2;
list2 = list2.next;
cur = cur.next;
}
}
while (list1 != null) {
cur.next = list1;
list1 = list1.next;
cur = cur.next;
}
while (list2 != null) {
cur.next = list2;
list2 = list2.next;
cur = cur.next;
}
return pre.next;
}
}
第二种:直接用递归时间复杂度O(n), 空间复杂度O(1);
/*
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) {
return list2;
}
if (list2 == null) {
return list1;
}
ListNode node = null;
if (list1.val < list2.val) {
node = list1;
node.next = Merge(list1.next, list2);
} else {
node = list2;
node.next = Merge(list1, list2.next);
}
return node;
}
}```