原题:
You are given two linked lists representing two non-negative numbers. 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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
我的解:
/**
* 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) {
ListNode* ln = new ListNode(0);
ListNode* pln = ln,*single_ln;
int digit=0, carry=0;
while(l1!=NULL && l2!=NULL){
digit = (l1->val + l2->val+carry)%10;
pln->next = new ListNode (digit);
pln = pln->next;
carry = (l1->val + l2->val+carry)/10;
l1 = l1->next;
l2 = l2->next;
}
if(l1!=NULL || l2!=NULL){
if(l1==NULL)
single_ln = l2;
else
single_ln = l1;
while(single_ln!=NULL){
pln->next = new ListNode ((single_ln->val+carry)%10);
carry = (single_ln->val+carry)/10;
pln = pln->next;
single_ln = single_ln->next;
}
if(carry!=0){
pln->next = new ListNode(carry);
}
}
else if(carry!=0){
pln->next = new ListNode(carry);
}
pln = ln->next;
delete(ln);
return pln;
}
};
解题思路:
变量carry是进位,digit是当前位
一开始的思路是,两数逐位相加再加上carry,结果保存到第三个数里,再更新carry。如果两个数长度相等,则最后一位为进位(如果进位不为0)。如果两个数长度不等,则在长度较短的数加完后,把进位加到更高一位,然后直接复制长数的剩余部分到第三个数里。
但这个想法是粗心的,因为如果1+999,那么结果为1000,即carry要传到最高一位。
所以正确的做法是,当剩下一个数还有高位没加完时,相加结果digit都等于carry加上该数的数位,同时更新carry。