https://leetcode-cn.com/problems/he-bing-liang-ge-pai-xu-de-lian-biao-lcof/
问题描述:
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
示例1:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
遍历方法:
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode myHead = new ListNode(-1);
ListNode tmp = myHead;
while(l1!=null || l2!=null){
if(l1!=null && (l2 == null || l1.val < l2.val)){
tmp.next = l1;
tmp = tmp.next;
l1 = l1.next;
}else{
tmp.next = l2;
tmp = tmp.next;
l2 = l2.next;
}
}
return myHead.next;
}
递归方法:
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;
}
l2.next = mergeTwoLists(l1,l2.next);
return l2;
}