题目地址
非递归代码
时间o(m+n)
空间o(1)
/**
* Definition for singly-linked list.
* public class ListNode {
* public int val;
* public ListNode next;
* public ListNode(int val=0, ListNode next=null) {
* this.val = val;
* this.next = next;
* }
* }
*/
public class Solution {
public ListNode MergeTwoLists(ListNode list1, ListNode list2)//相当于一个单链表
{
ListNode result=new ListNode();
ListNode tmp=new ListNode();
result=tmp;
while(list1!=null&&list2!=null){
if(list1.val>list2.val){
tmp.next=list2;
list2=list2.next;
tmp=tmp.next;
}else{
tmp.next=list1;
list1=list1.next;
tmp=tmp.next;
}
}
if(list1==null)
tmp.next=list2;
if(list2==null)
tmp.next=list1;
return result.next;
}
}
递归代码
时间o(m+n)
空间o(m+n):递归要入栈出栈
//递归解法
if(list1==null)
return list2;
if(list2==null)
return list1;
if(list1.val<list2.val){
list1.next=MergeTwoLists(list1.next,list2);
return list1;
}else{
list2.next=MergeTwoLists(list2.next,list1);
return list2;
}