代码实现:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution
{
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)
{
ListNode* ans=new ListNode,*head=ans;
int carry=0;
while(l1!=nullptr&&l2!=nullptr)
{
ans->next=new ListNode;
ans=ans->next;
ans->val=(l1->val+l2->val+carry)%10;
carry=(l1->val+l2->val+carry)/10;
l1=l1->next;
l2=l2->next;
}
ListNode* cont=(l1)?l1:l2;
while(cont!=nullptr)
{
ans->next=new ListNode;
ans=ans->next;
ans->val=(cont->val+carry)%10;
carry=(cont->val+carry)/10;
cont=cont->next;
}
if(carry==0)
return head->next;
ans->next=new ListNode;
ans->next->val=1;
return head->next;
}
};
运行结果: