题目描述
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
样例
Example:
Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4
思路分析
递归形式,思路同剑指offer(16)
代码
/**
* 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;
}
if (l1.val <= l2.val)
{
l1.next = mergeTwoLists(l1.next, l2);
return l1;
}
else
{
l2.next = mergeTwoLists(l1,l2.next);
return l2;
}
}
}
结果