ListNode*root=new ListNode(0), *pre=root;
int carry=0;
while(l1!=NULL || l2!=NULL)
{
if(l1!=NULL) {carry+= l1->val; l1= l1->next;}
if(l2!=NULL) {carry+= l2->val; l2= l2->next;}
pre->next=new ListNode(carry%10);
carry/=10;
pre=pre->next;
}
if(carry!=0)
pre->next=new ListNode(carry);
pre=root->next;
free(root);
return pre;
2 Add Two Numbers
最新推荐文章于 2020-02-23 04:39:50 发布