合并两个排序链表

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.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class {

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if(l1==null)
return l2;
if(l2==null)
return l1;

ListNode ans;
if(l1.val<l2.val)
{
ans=l1;
ans.next=mergeTwoLists(l1.next,l2);
}
else
{
ans=l2;
ans.next=mergeTwoLists(l1,l2.next);
}
return ans;
}
}