这题用递归和迭代都可以做,先看看迭代
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode res = new ListNode(-1);
ListNode head = res;
while(l1 != null && l2 != null){
if(l1.val < l2.val){
res.next = l1;
l1 = l1.next;
}else{
res.next = l2;
l2 = l2.next;
}
res = res.next;
}
if(l1 != null)
res.next = l1;
if(l2 != null)
res.next = l2;
return head.next;
}
}
算法复杂度
- 时间复杂度: O ( m + n ) O(m + n) O(m+n),需要遍历两个链表
- 空间复杂度: O ( 1 ) O(1) O(1),所用的变量占常数空间
再看递归
class Solution {
ListNode res = new ListNode(-1);
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode head = res;
merge(l1, l2);
return head.next;
}
private void merge(ListNode l1, ListNode l2){
if(l1 == null){
res.next = l2;
return;
}
if(l2 == null){
res.next = l1;
return;
}
if(l1.val < l2.val){
res.next = l1;
res = res.next;
merge(l1.next, l2);
}else{
res.next = l2;
res = res.next;
merge(l1, l2.next);
}
}
}
算法复杂度
- 时间复杂度: O ( m + n ) O(m + n) O(m+n),需要遍历两个链表
- 空间复杂度: O ( m + n ) O(m + n) O(m+n),最坏的情况下, l 1 l_1 l1和 l 2 l_2 l2的大小交替变化,需要开启的栈空间为 O ( m + n ) O(m+n) O(m+n),最好的情况下,一条链表始终比另外一条链表小 O ( min ( m , n ) ) O(\min(m,n)) O(min(m,n))