题目
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
直接模拟,注意进位,和最后的进位
代码
/**
* 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 *sum=NULL,*pos1,*pos2;
while(l1!=NULL||l2!=NULL)
{
if(l1!=NULL&&l2!=NULL)
{
pos1=new ListNode((l1->val+l2->val+carry)%10);
carry=(l1->val+l2->val+carry)/10;
l1=l1->next;
l2=l2->next;
}
else if(l1!=NULL)
{
pos1=new ListNode((l1->val+carry)%10);
carry=(l1->val+carry)/10;
l1=l1->next;
}
else
{
pos1=new ListNode((l2->val+carry)%10);
carry=(l2->val+carry)/10;
l2=l2->next;
}
if(sum==NULL)
{
sum=pos1;
pos2=pos1;
}
else
{
pos2->next=pos1;
pos2=pos1;
}
}
if(carry)
{
pos1=new ListNode(1);
pos2->next=pos1;
}
return sum;
}
};