例如:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
凡是链表的题目思路一定要缜密。犯了三个错误。
<span style="font-size:14px;">ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
if(!l1) return l2;
if(!l2) return l1;
ListNode *res,*p1=l1,*p2=l2,*pre;
int carry=0,s1=0,s2=0;
//在这里进行了<strong>res=l1</strong>结果后来l1和l2交换,导致指向错误的链表!
while(p1){s1++;p1=p1->next;}
while(p2){s2++;p2=p2->next;}
if(s1<s2) swap(l1,l2);
res=l1;
while(l1 && l2){
int sum = l1->val+l2->val+carry;
l1->val= sum%10;//此处用l1->val+l2->val+carry赋值就错了
carry= sum/10;
pre=l1; // 容易疏忽,要保留前项
l1=l1->next;
l2=l2->next;
}
if(s1==s2&&carry){
ListNode *p = new ListNode(1);
pre->next=p;
}
else if(carry){
while(l1){
if(l1->val==9){l1->val=0;carry=1;pre=l1;l1=l1->next;}
else {l1->val++;carry=0;break;}
}
if(carry){
ListNode *p = new ListNode(1);
pre->next=p;
}
}
return res;
}</span>