原题
本题较为简单,但是只想到了迭代的解法,没有想到递归。
迭代法
解题思路
比较L1与L2并增加新链表的节点,值为L1或者L2中较小的值。
代码
public class Solution21 {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null && l2 == null)
return null;
ListNode mergeHead = new ListNode(0), mergeIterator = mergeHead;
ListNode l1Iterator = l1, l2Iterator = l2;
while ( l1Iterator != null && l2Iterator != null){
if ( l1Iterator.val <= l2Iterator.val){
mergeIterator.next = new ListNode(l1Iterator.val);
l1Iterator = l1Iterator.next;
} else{
mergeIterator.next = new ListNode(l2Iterator.val);
l2Iterator = l2Iterator.next;
}
mergeIterator = mergeIterator.next;
}
mergeIterator.next = (l1Iterator != null) ? l1Iterator : l2Iterator;
return mergeHead.next;
}
}
递归法(参考解答递归解法)
图解
代码
public class Solution21_Recursive {
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;
}
}
}