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) {
ListNode* mylist = new ListNode(0);
mylist ->val = (l1->val + l2->val)%10;
int res = (l1->val + l2->val)/10;
l1 = l1->next;
l2 = l2->next;
ListNode* p = mylist;
int l1value,l2value;
while(1)
{
if(l1==NULL && l2 ==NULL)
{
if(res ==0)
break;
else
{
ListNode* newnode = new ListNode(res);
p->next = newnode;
break;
}
}
if(l1!=NULL)
l1value = l1->val;
else
l1value = 0;
if(l2!=NULL)
l2value = l2->val;
else
l2value = 0;
if(l1!=NULL || l2 !=NULL)
{
ListNode* newnode = new ListNode(0);
newnode ->val = (l1value + l2value +res )%10;
res = (l1value + l2value +res)/10;
p->next = newnode;
p=p->next;
}
if(l1!=NULL)
l1 = l1->next;
if(l2!=NULL)
l2 = l2->next;
}
return mylist;
}
};