2017-09-11 LeetCode_021 Merge Two Sorted Lists

21. 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.

solution:

class Solution {

2

public:

3

    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {

4

        if (l1 == NULL) return l2;

5

        if (l2 == NULL) return l1;

6

        if (l1->val < l2->val) {

7

            l1->next = mergeTwoLists(l1->next, l2);

8

            return l1;

9

        } else {

10

            l2->next = mergeTwoLists(l1, l2->next);

11

            return l2;

12

        }

13

    }

14

};