题目描述:
代码如下:迭代
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode newhead=new ListNode(0);
ListNode curr=newhead;
while (l1!=null&&l2!=null){
if(l1.val<l2.val){
curr.next=l1;
curr=curr.next;
l1=l1.next;
}else{
curr.next=l2;
curr=curr.next;
l2=l2.next;
}
}
if(l1==null){
curr.next=l2;
}
if(l2==null){
curr.next=l1;
}
return newhead.next;
}
}
递归:
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
//终止条件
if (l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
if (l1.val < l2.val) {
l1.next = mergeTwoLists(l1.next, l2);
return l1;
} else {
l2.next = mergeTwoLists(l1, l2.next);
return l2;
}
}
}