题目:
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
解析:声明一个进位标示flag,当有进位时,将flag置为1。代码如下:
/**
* 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 flag=0;
ListNode *result=new ListNode(0);
ListNode *temp=result;
while(l1!=NULL&&l2!=NULL)
{
int num=l1->val+l2->val+flag;
if(num>=10)
{
num-=10;
flag=1;
}
else
{
flag=0;
}
l1=l1->next;
l2=l2->next;
temp->next=new ListNode(num);
temp=temp->next;
}
while(l1!=NULL)
{
int num=l1->val+flag;
if(num>=10)
{
num-=10;
flag=1;
}
else
{
flag=0;
}
l1=l1->next;
temp->next=new ListNode(num);
temp=temp->next;
}
while(l2!=NULL)
{
int num=l2->val+flag;
if(num>=10)
{
num-=10;
flag=1;
}
else
{
flag=0;
}
l2=l2->next;
temp->next=new ListNode(num);
temp=temp->next;
}
if(flag==1)
temp->next=new ListNode(1);
return result->next;
}
};