Add Two Numbers

Add Two Numbers

 

AC Rate: 1268/5597

My Submissions

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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if (l1 == NULL || l2 == NULL)
            return NULL;

        bool add = false;
        ListNode * res = NULL, * p = NULL;
        while (l1 || l2) {
            if (l1 && l2) {
                int ts = l1->val + l2->val;
                if (add) {
                    ts += 1;
                }
                add = ts > 9 ? true : false;
                ListNode * t = new ListNode (ts % 10);
                if (res == NULL) {
                    res = t;
                    p = t;
                }
                else {
                    p->next = t;
                    p = t;
                }
                l1 = l1->next;
                l2 = l2->next;
            }
            else {
                ListNode * q = (l1 == NULL ? l2 : l1);
                if (l1) {
                    l1 = l1->next;
                }
                if (l2) {
                    l2 = l2->next;
                }

                if (q) {
                    int ts = q->val;
                    if (add) {
                        ts += 1;
                    }
                    add = ts > 9 ? true : false;
                    ListNode * t = new ListNode (ts % 10);
                    if (res == NULL) {
                        res = t;
                        p = t;
                    }
                    else {
                        p->next = t;
                        p = t;
                    }
                }
            }
        }
        if (add) {
            ListNode * t = new ListNode (1);
            p->next = t;
            p = t;
        }
        return res;
    }
};