/**
这道题不是很难,主要是有一些细节需要注意
* 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 tmp = 0;
ListNode *res = l1;
ListNode *pPre = l1;
while(l1!=NULL || l2!=NULL){
if(l1!=NULL && l2!=NULL){
l1->val += l2->val+tmp;
pPre = l1;
}
else if(l1==NULL && l2!=NULL){
l1 = new ListNode(l2->val + tmp);
l1->next = NULL;
pPre->next = l1;
pPre = l1;
}
else if(l1!=NULL && l2==NULL){
l1->val += tmp;
pPre = l1;
}
if(l1->val >= 10) tmp = 1;
else tmp = 0;
l1->val %= 10;
if(l1!=NULL) l1 = l1->next;
if(l2!=NULL) l2 = l2->next;
}
//最后要处理一种特殊情况,当相加之后多了一位
if(tmp){
l1 = new ListNode(1);
l1->next = NULL;
pPre->next = l1;
}
return res;
}
};