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* p = l1;
ListNode* q = l2;
ListNode* dummy = new ListNode(0);
ListNode* ans = dummy;
int sum = 0;
while(p !=NULL|| q != NULL){
sum /= 10;
if(p){
sum += p->val;
p = p->next;
}
if(q){
sum += q->val;
q = q->next;
}
ans->next = new ListNode(sum % 10);
ans = ans->next;
}
if(sum / 10 == 1){
ans->next = new ListNode(1);
}
return dummy->next;
}
};