Description:
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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
解题思路:这里对如何进行相加、如何进位等问题不再进行分析,要重点关注的是在解题时一定要注意的几个特殊情况:
1、其中有一个数为0;
2、两个数字的位数并不相同;
3、两个相同位数的数字加完之后又多出了一位数。
我觉得只要考虑到了上面几个情况应该就没有啥问题了吧。
/**
* 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 *ans=new ListNode(0);
ListNode *temp=ans;
int carry =0;
while(true){
if(l1!=NULL){
carry+=l1->val;
l1=l1->next;
}
if(l2!=NULL){
carry+=l2->val;
l2=l2->next;
}
temp->val=carry%10;
carry=carry/10;
if(l1!=NULL||l2!=NULL||carry!=NULL){
temp=temp->next=new ListNode(0);
}
else break;
}
return ans;
}
};