题目描述:
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4 输出:1->1->2->3->4->4
解题思路:
代码实现(Java语言):
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
//非递归实现
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1 == null)
return l2;
if(l2 == null)
return l1;
ListNode head;
if(l1.val < l2.val){
head = l1;
l1 = l1.next;
}else{
head = l2;
l2 = l2.next;
}
ListNode tempHead = head;
while(l1!=null && l2!=null){
if(l1.val < l2.val){
tempHead.next = l1;
l1 = l1.next;
}else{
tempHead.next = l2;
l2 = l2.next;
}
tempHead = tempHead.next;
}
if(l1 == null)
tempHead.next = l2;
else
tempHead.next = l1;
return head;
}
//递归实现
public ListNode mergeTwoLists2(ListNode l1, ListNode l2) {
if(l1 == null)
return l2;
if(l2 == null)
return l1;
ListNode head;
if(l1.val < l2.val){
head = l1;
head.next = mergeTwoLists(l1.next,l2);
}else{
head = l2;
head.next = mergeTwoLists(l1,l2.next);
}
return head;
}
}