题目描述
给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4) 输出:7 -> 0 -> 8 原因:342 + 465 = 807
简答:
/**
* 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 = l1->val + l2->val;
int val = sum % 10;
sum = sum / 10;
ListNode *end = new ListNode(val);
ListNode *begin = end;
while (l1->next != NULL && l2->next != NULL)
{
l1 = l1->next;
l2 = l2->next;
int sum1 = l1->val + l2->val + sum;
val = sum1 % 10;
sum = sum1 / 10;
ListNode *temp = new ListNode(val);
end->next = temp;
end = end->next;
}
while (l1->next != NULL )
{
l1 = l1->next;
int sum1 = l1->val+ sum;
val = sum1 % 10;
sum = sum1 / 10;
ListNode *temp = new ListNode(val);
end->next = temp;
end = end->next;
}
while (l2->next != NULL)
{
l2 = l2->next;
int sum1 = l2->val + sum;
val = sum1 % 10;
sum = sum1 / 10;
ListNode *temp = new ListNode(val);
end->next = temp;
end = end->next;
}
if (sum > 0){
ListNode *temp = new ListNode(sum);
end->next = temp;
end = end->next;
}
return begin;
}
};
评论前必须登录!