OJ-Problems-Source/LeetCode-CN/2.cpp

#ifdef __cplusplus
#include <cstdio>
#include <cstdlib>
#include <cstring>
#else
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#endif

ListNode* BigIntegerAdd(ListNode* a, ListNode* b,
    int* tmp)
{
    ListNode* pa = a;
    ListNode* pb = b;
    int pos = 0;
    while (pa != NULL && pb != NULL)
    {
        tmp[pos] = pa->val + pb->val;
        pa = pa->next;
        pb = pb->next;
        pos++;
    }
    while (pa != NULL)
    {
        tmp[pos] = pa->val;
        pa = pa->next;
        pos++;
    }
    while (pb != NULL)
    {
        tmp[pos] = pb->val;
        pb = pb->next;
        pos++;
    }
    ListNode* head = NULL;
    ListNode** pthis = &head;
    for (int i = 0; i < pos; i++)
    {
        if (tmp[i] >= 10)
        {
            tmp[i + 1] += tmp[i] / 10;
            tmp[i] %= 10;
        }

        (*pthis) = new ListNode(tmp[i]);
        pthis = &((*pthis)->next);
    }

    if (tmp[pos] > 0)
    {
        (*pthis) = new ListNode(tmp[pos]);
        pthis = &((*pthis)->next);
    }

    return head;
}


class Solution {
public:
    ListNode * addTwoNumbers(ListNode* l1, ListNode* l2) {
        int tmp[1024] = { 0 };
        return BigIntegerAdd(l1, l2, tmp);
    }
};