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
Code:
<span style="font-size:14px;">/**
* 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;
int sum;
ListNode *begin = l1, *end;
while (l1 != NULL && l2 != NULL) {
sum = carry+l1->val+l2->val;
carry = sum/10;
l1->val = sum%10;
end = l1;
l1 = l1->next;
l2 = l2->next;
}
if (l2 != NULL) {
end->next = l2;
l1 = l2;
}
if (l1 != NULL)
while (l1 != NULL) {
sum = carry+l1->val;
carry = sum/10;
l1->val = sum%10;
end = l1;
l1 = l1->next;
}
if (carry)
end->next = new ListNode(carry);
return begin;
}
};</span>