Add Two Numbers

Leetcode Problem Set

Algorithm Question 2

Problem description:

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

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

Thinking

As mentioned in the description, digits of number are listed in reverse order, the very beginning digit is the least significant digit. In order to get the sum, we need to add up digits of list1 and list2 one by one, and then judge whether there is a carry digit, after these carry digits handled, we can combine numbers together, which could be our final answer.When it comes to carry digit, checking the condition that the sum is greater than 10

Code:

// written in C++
class Solution {
public:

    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* back = new ListNode(0);
        ListNode* pre = back;
        bool adder = false;
        int sum;
        while (l1 != NULL && l2 != NULL) {
            sum = l1->val + l2->val;
            if (adder) sum++;
            sum>9?adder=true,sum%=10:adder = false;

            pre->next = new ListNode(sum);
            pre = pre->next;

            l1 = l1->next;
            l2 = l2->next;
        }
        // add each pair of corresponding digits of list1 and list2 one by one.
        while (l1 != NULL)  {
            sum = l1->val;
            if (adder) sum++;
            sum>9?adder=true,sum%=10:adder = false;
            pre->next = new ListNode(sum);
            pre = pre->next;
            l1  = l1->next;
        }
        while (l2 != NULL)  {
            sum = l2->val;
            if (adder) sum++;
            sum>9?adder=true,sum%=10:adder = false;
            pre->next = new ListNode(sum);
            pre = pre->next;
            l2  = l2->next;
        }
        // handle another non-empty list
        if (adder && l1 == NULL && l2 ==NULL) {
            pre->next = new ListNode(1);
        }
        //if numbers have same digit , and finally one more digit are required. 
        return back->next;
    }
};

Additional

At first I got wrong about the problem, I suppose numbers are given in right order, and the output must be in right order, so to solve the problem this time, I want to read numbers in lists respectively, then add them up together, next put the number in one list by dividing 10 successively, and finally reverse the list.
Here is my code, because I have a little extreme cases, I cannot tell the program is complete and robust enough.

ListNode*  addTwoNumbers(ListNode* l1, ListNode* l2) {
        int add1, add2;
        add1 = 0;
        add2 = 0;
        ListNode* start = new ListNode(0);
        ListNode* pre = start;
        while (l1 != NULL) {
            add1 *= 10;
            add1 += l1->val;
            l1 = l1->next;
        }
        while (l2 != NULL) {
            add2 *= 10;
            add2 += l2->val;
            l2 = l2->next;
        }
        add1 = add1+ add2;
         while (add1 != 0) {
             pre->next = new ListNode(add1 % 10);
             pre = pre->next;
             add1 /= 10;
         }

         ListNode* last, *pres, *next;
         last = start->next;
         pre = last->next;
         while (pre != NULL) {
            next = pre->next;
            pre->next = last;
            last = pre;
            pre = next;
         }
         start->next->next = NULL;
        return last;
    }

---

edited by Maoyuan, SYSU