/**
* 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 carry=0;
ListNode *curr1=l1,*curr2=l2;
ListNode *head=NULL,*temp;
while(curr1&&curr2)
{
int num=curr1->val+curr2->val+carry;
carry=num/10;
if(!head)
{
head=new ListNode(num%10);
temp=head;
}
else
{
temp->next=new ListNode(num%10);
temp=temp->next;
}
curr1=curr1->next;
curr2=curr2->next;
}
while(curr1)
{
int num=curr1->val+carry;
carry=num/10;
temp->next=new ListNode(num%10);
temp=temp->next;
curr1=curr1->next;
}
while(curr2)
{
int num=curr2->val+carry;
carry=num/10;
temp->next=new ListNode(num%10);
temp=temp->next;
curr2=curr2->next;
}
if(carry)
temp->next=new ListNode(carry);
return head;
}
};
leetcode 2: Add Two Numbers
最新推荐文章于 2020-07-14 12:02:11 发布