[leetcode2]
Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
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 *result1=NULL;
ListNode *result=NULL;
int add = 0;
ListNode* left = l1;
ListNode* right = l2;
while (left && right)
{
int num1 = left->val;
int num2 = right->val;
int sum = num1 + num2 + add;
ListNode *cur = new ListNode(sum % 10);
add = sum / 10;
if(result1==NULL)
{
result1=cur;
result=result1;
}
else
{
result->next = cur;
result = cur;
}
left = left->next;
right = right->next;
}
while (left)
{
int num1 = left->val;
int sum = num1 + add;
ListNode *cur = new ListNode(sum % 10);
add = sum / 10;
result->next = cur;
result = cur;
left= left->next;
}
while (right)
{
int num2 = right->val;
int sum = num2 + add;
ListNode *cur = new ListNode(sum % 10);
add = sum / 10;
result->next = cur;
result = cur;
right= right->next;
}
if(add)
{
ListNode *cur = new ListNode(add);
result->next = cur;
result = cur;
}
return result1;
}
};