LeetCode —— Add Two Numbers

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        if (l1 == NULL) return l2;
        if (l2 == NULL) return l1;
        ListNode *head = new ListNode((l1->val + l2->val) % 10);
        int carry = (l1->val + l2->val) / 10;
        head->next = addTwoNumbers(l1->next, l2->next, carry);
        if (carry) {
            ListNode *pNode = head;
            while(pNode->next != NULL)
                pNode = pNode->next;
            ListNode *pTail = new ListNode(carry);
            pNode->next = pTail;
        }
        return head;
    }
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2, int &carry) {
        if (l1 == NULL && l2 == NULL) return NULL;
        if (l1 == NULL) {
            if (carry) {
                int val = l2->val + carry;
                l2->val = val % 10;
                carry = val / 10;
                addTwoNumbers(NULL, l2->next, carry);
            }
            return l2;
        }
        if (l2 == NULL) {
            if (carry) {
                int val = l1->val + carry;
                l1->val = val % 10;
                carry = val / 10;
                addTwoNumbers(l1->next, NULL, carry);
            }
            return l1;
        }
        ListNode *head = new ListNode((l1->val + l2->val + carry) % 10);
        carry = (l1->val + l2->val + carry) / 10;
        head->next = addTwoNumbers(l1->next, l2->next, carry);
        return head;
    }
};