8ms C++ recursive solution


  • 0
    M
    /**
     * 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 (l2 == NULL)
            {
                return l1;
            }
            if (l1 == NULL)
            {
                return l2;
            }
            
            if (l1->val > l2->val)
            {
                ListNode* temp = l2;
                temp->next=mergeTwoLists(l1, l2->next);
                return temp;
            }
            else
            {
                ListNode* temp = l1;
                temp->next=mergeTwoLists(l1->next, l2);
                return temp;
            }
        }
    };

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.