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

class Solution
{
  public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)
    {
        if (l1 == NULL)
            return l2;
        if (l2 == NULL)
            return l1;
        int carry = 0;
        ListNode dummy(-1);
        ListNode* prev = &dummy;
        for (ListNode* pa = l1, *pb = l2; pa != NULL || pb != NULL;
                                   pa = pa==NULL ? NULL : pa->next,
                                   pb = pb==NULL ? NULL : pb->next,
                                   prev = prev->next)
        {
            const int ai = pa == NULL ? 0 : pa->val;
            const int bi = pb == NULL ? 0 : pb->val;
            const int value = (ai + bi + carry)%10;
            carry = (ai + bi + carry)/10;
            prev->next = new ListNode(value);
        }
        if (carry > 0)
            prev->next = new ListNode(carry);
        return dummy.next;
    }
};