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 c=0;
ListNode* tail=new ListNode(0);
ListNode* ptr=tail;
int val1,val2,temp;
while(l1!=NULL||l2!=NULL)
{
val1=0;
if(l1!=NULL)
{
val1=l1->val;
l1=l1->next;
}
val2=0;
if(l2!=NULL)
{
val2=l2->val;
l2=l2->next;
}
temp=val1+val2+c;
if(temp>9)
{
c=1;
temp-=10;
}
else
c=0;
ptr->next=new ListNode(temp);
ptr=ptr->next;
}
if(c==1)
ptr->next=new ListNode(1);
return tail->next;
}
};