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.

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

题意：给你两个链表，表示两个反过来的数字，求相加后的和（也翻过来输出）。样例就是 342 + 456 = 708

嗯，就是一个模拟的加法【托腮】但是解答有一个很棒的点，就是初始设为空。我本来设的有值，结果最后多出一个0不知道怎么处理，比较惆怅。

/**
 * 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;
        ListNode* d = new ListNode(0);
        ListNode* ans = d;
        while (l1 != NULL || l2 != NULL) {
            sum /= 10;
            if (l1 != NULL) {
                sum += l1->val;
                l1 = l1->next;
            }
            if (l2 != NULL) {
                sum += l2->val;
                l2 = l2->next;
            }
            d->next = new ListNode(sum % 10);
            d = d->next;
        }
        if (sum / 10) {
            d->next = new ListNode(sum / 10);
        }
        return ans->next;
    }
};