/**
* 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 num1[100], num2[100], num[100];
memset(num1, 0, sizeof(num1));
memset(num2, 0, sizeof(num2));
int index1 = 0, index2 = 0;
while (l1 != NULL)
{
num[index1] = l1->val;
l1 = l1->next;
index1 ++;
}
for (int i = index1 - 1; i >= 0; i--)
{
num1[i] = num[i];
}
while (l2 != NULL)
{
num[index2] = l2->val;
l2 = l2->next;
index2 ++;
}
for (int i = index2 - 1; i >= 0; i--)
{
num2[i] = num[i];
}
memset(num, 0, sizeof(num));
int l = max(index1, index2);
for (int i = 0; i < l; i++)
num[i] = num1[i] + num2[i];
for (int i = 0; i < l; i++)
{
num[i + 1] += (num[i]) / 10;
num[i] = (num[i]) % 10;
}
if (num[l] > 0)
{
if (num[l] > 9)
{
num[l + 1] = num[l] / 10;
num[l] = num[l] % 10;
}
l++;
}
ListNode *sumNode = new ListNode(2);
ListNode *lastNode = sumNode;
int index = 0;
while (index < l)
{
ListNode *node = new ListNode(0);
lastNode->val = num[index];
if (index != l -1)
lastNode->next = node;
lastNode = node;
index++;
}
return sumNode;
}
};
LeetCode Add Two Numbers
最新推荐文章于 2024-08-12 10:14:14 发布