LeetCode 445. Add Two Numbers II

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

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

分析：

题目要求不能翻转链表，考虑递归或者栈。

/**
 * 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) {
        stack<ListNode *> s1;
        stack<ListNode *> s2;
        stack<ListNode *> result;

        int carry = 0;
        ListNode *cur1 = l1;
        ListNode *cur2 = l2;

        while (cur1) {
            s1.push(cur1);
            cur1 = cur1->next;
        }

        while (cur2) {
            s2.push(cur2);
            cur2 = cur2->next;
        }

        while (!s1.empty() && !s2.empty()) {
            ListNode *node1 = s1.top();
            ListNode *node2 = s2.top();
            s1.pop();
            s2.pop();

            int sum = node1->val + node2->val + carry;
            int val = sum % 10;
            carry = sum / 10;

            ListNode *newNode = new ListNode(val);
            result.push(newNode);
        }

        while (!s1.empty()) {
            ListNode *node = s1.top();
            s1.pop();

            int sum = node->val + carry;
            int val = sum % 10;
            carry = sum / 10;

            ListNode *newNode = new ListNode(val);
            result.push(newNode);
        }

        while (!s2.empty()) {
            ListNode *node = s2.top();
            s2.pop();

            int sum = node->val + carry;
            int val = sum % 10;
            carry = sum / 10;

            ListNode *newNode = new ListNode(val);
            result.push(newNode);
        }

        if (carry) {
            ListNode *newNode = new ListNode(1);
            result.push(newNode);
        }

        ListNode dummy(-1);
        ListNode *cur = &dummy;

        while (!result.empty()) {
            ListNode *node = result.top();
            result.pop();

            cur->next = node;
            cur = cur->next;
        }
        cur->next = NULL;

        return dummy.next;
    }
};