合并两个有序链表
递归方法
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null) {
return l2;
}
if (l2 == null) {
return l1;
}
if (l1.val < l2.val) {
ListNode rs = l1;
rs.next = mergeTwoLists01(l1.next,l2);
return rs;
}
else {
ListNode rs = l2;
rs.next = mergeTwoLists01(l1,l2.next);
return rs;
}
}