Merge Two Sorted Lists

https://leetcode.com/problems/merge-two-sorted-lists/

题目

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

题意：合并两个有序的链表，使之合并完还有序。

/**
 * 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;
    	}else if(l2==null) {
    		return l1;
    	}
    	
    	ListNode result=null;
    	if(l1.val<=l2.val) {
    		result=l1;
    		result.next=mergeTwoLists(l1.next, l2);
    	}else {
    		result=l2;
    		result.next=mergeTwoLists(l1, l2.next);
    	}
    	return result;
    }
}