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
Runtime: 264 ms
/**
* 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 *result = new ListNode(0);
ListNode *node = result;
int carry = 0;
while(l1 || l2)
{
int sum = carry;
if(l1)
{
sum += l1->val;
l1 = l1->next;
}
if(l2)
{
sum += l2->val;
l2 = l2->next;
}
node->next = new ListNode(sum % 10);
carry = sum / 10;
node = node->next;
}
if(carry)
{
node->next = new ListNode(carry);
}
return result->next;
}
};