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和discussion，这份思路比较清晰。

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode* p = l1;
        ListNode* q = l2;
        ListNode dummyHead(0), *curr = &dummyHead;
        int carry = 0;
        while (p != NULL || q != NULL) {
            int x = (p != NULL) ? p->val : 0;
            int y = (q != NULL) ? q->val : 0;
            int sum = carry + x + y;
            carry = sum / 10;
            curr->next = new ListNode(sum % 10);
            curr = curr->next;
            if (p != NULL)
                p = p->next;
            if (q != NULL)
                q = q->next;
        }
        if (carry > 0) {
            curr->next = new ListNode(carry);
        }
        return dummyHead.next;
    }
};

代码一（不对）：

一开始，我：想那么多干嘛，484撒，直接转成整数相加再转成链表呗…
10min后….我484撒….链表长度受限啊喂。

class Solution {
public:
    // 缺点：链表的长度受限于int
    static ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        vector<int> v1, v2;
        int num1 = 0, num2 = 0;
        int mul, resNum;
        // 把链表存入vector中
        ListNode* tmp = l1;
        ListNode* res;
        mul = 1;
        while (tmp != NULL) {
            num1 += tmp->val * mul;
            mul *= 10;
            tmp->next;
        }
        tmp = l2;
        mul = 1;
        while (tmp != NULL) {
            num1 += tmp->val * mul;
            mul *= 10;
            tmp->next;
        }
        // 转化成整数相加得出结果
        resNum = num1 + num2;
        // 再把该整数结果转化成链表形式。
        mul = 1;
        while (resNum / mul != 0) {
            res = new ListNode(resNum % mul)......没打完，觉得不对
        }
        return res;
    }
};

代码二（一年前出错的代码2333，懒得修改了）放上来。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    static ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        bool flag = false;
        ListNode* tmp1 = l1;
        ListNode* tmp2 = l2;
        int sum = tmp1->val + tmp2->val;
        if (sum >= 10) sum -= 10;
        ListNode* tmp = new ListNode(sum);
        ListNode* ptmp = tmp;
        tmp1 = tmp1->next;
        tmp2 = tmp2->next;
        while (tmp1 != NULL || tmp2 != NULL || flag ) {
            int sum = tmp1->val + tmp2->val;
            if (flag) {
                sum++;
                flag = false;
            }
            if (sum >= 10) {
                sum -= 10;
                flag = true;
            }
            ptmp->next = new ListNode(sum);
            tmp1 = tmp1->next;
            tmp2 = tmp2->next; 
            ptmp = ptmp->next;
        }
        return tmp;
    }
};