[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) {
        ListNode* front = new ListNode(0);
        ListNode* ptr = front;
        int c = 0;
        
        while(l1 != NULL || l2 != NULL){
            int num1 = 0;
            if(l1 != NULL){
                num1 = l1 -> val;
                l1 = l1 -> next;
            }
            int num2 = 0;
            if(l2 != NULL){
                num2 = l2 -> val;
                l2 = l2 -> next;
            }
            int num = num1 + num2 + c;
            ptr -> next = new ListNode(num % 10);
            c = num / 10;
            ptr = ptr -> next;
        }
        if(c == 1) ptr -> next = new ListNode(1);
        return front -> next;
    }
};