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 stackAnchor(0);
        ListNode* tail = &stackAnchor;
        div_t sum = { 0, 0 };
        while(sum.quot > 0 || l1 || l2)
        {
            if (l1)
            {
                sum.quot += l1->val;
                l1 = l1->next;
            }
            if (l2)
            {
                sum.quot += l2->val;
                l2 = l2->next;
            }
            sum = div(sum.quot, 10);
            tail->next = new ListNode(sum.rem);
            tail = tail->next;
        }
        return stackAnchor.next;
    }
};

来自为知笔记(Wiz)