Add Two Numbers
Nov 1 '11
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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode *l = new ListNode(0);
ListNode *r = l;
int carry = 0;
int val = 0;
while (l1 && l2) {
val = carry + l1->val + l2->val;
carry = val / 10;
l->next = new ListNode(val%10);
l = l->next;
l1 = l1->next;
l2 = l2->next;
}
while (l1) {
val = carry + l1->val;
carry = val / 10;
l->next = new ListNode(val%10);
l = l->next;
l1 = l1->next;
}
while (l2) {
val = carry + l2->val;
carry = val / 10;
l->next = new ListNode(val%10);
l = l->next;
l2 = l2->next;
}
if (carry)
l->next = new ListNode(carry);
ListNode *tmp = r;
r = r->next;
delete tmp;
return r;
}
};