leetcode 21 合并两个有序链表

直接上代码 就不解释了  意义不大；

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) 
    {
        if(l1==nullptr)return l2;
        if(l2==nullptr)return l1;
        
        if(l1->val<=l2->val)
        {
            l1->next=mergeTwoLists(l1->next,l2);
            return l1;
        }
        else l2->next=mergeTwoLists(l1,l2->next);
        return l2;
    }
};