[leetcode] 2. Add Two Numbers

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
Explanation: 342 + 465 = 807.

Solution:

思路就是模拟加法的计算过程。这道题重点在于各种特殊情况（主要是进位）的考虑，有很多坑的地方，代码也写得很冗余。

/**
 * 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) {
        int sum = 0, carry = 0;
        ListNode* ret = NULL;
        ListNode* tmp = ret;
        while (l1 && l2) {
            sum = carry + l1->val + l2->val;
            if (sum < 10) {
                carry = 0;
            } else {
                carry = 1;
                sum = sum % 10;
            }
            if (!ret) {
                ret = new ListNode(sum);
                tmp = ret;   
            } else {
                tmp->next = new ListNode(sum);
                tmp = tmp->next;
            }
            l1 = l1->next; l2 = l2->next;
        }

        while (l1) {
            if (!ret) {
                ret = new ListNode(l1->val);
                tmp = ret;
            } else {
                sum = l1->val + carry;
                if (sum < 10) {
                    carry = 0;
                } else {
                    carry = 1;
                    sum = sum % 10;
                }
                tmp->next = new ListNode(sum);
                tmp = tmp->next;
            }
            l1 = l1->next;
        }

        while (l2) {
            if (!ret) {
                ret = new ListNode(l2->val);
                tmp = ret;
            } else {
                sum = l2->val + carry;
                if (sum < 10) {
                    carry = 0;
                } else {
                    carry = 1;
                    sum = sum % 10;
                }
                tmp->next = new ListNode(sum);
                tmp = tmp->next;
            }
            l2 = l2->next;
        }

        if (carry) {
            tmp->next = new ListNode(carry);
        }

        return ret;
    }
};