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) {
if(l1 == NULL) return l2;
if(l2 == NULL) return l1;
int c = 0;
ListNode *head = NULL, *last = NULL;
bool first = true;
while(l1 && l2)
{
int t = l1->val +l2->val + c;
c = t / 10;
ListNode *p = new ListNode(t % 10);
if(first)
{
head = last = p;
first = false;
}
last->next = p;
last = p;
last->next = NULL;
l1 = l1->next;
l2 = l2->next;
}
while(l1)
{
int t = l1->val + c;
c = t / 10;
ListNode *p = new ListNode(t % 10);
last->next = p;
last = p;
last->next = NULL;
l1 = l1->next;
}
while(l2)
{
int t = l2->val + c;
c = t / 10;
ListNode *p = new ListNode(t % 10);
last->next = p;
last = p;
p->next = NULL;
l2 = l2->next;
}
if(c != 0)
{
ListNode *p = new ListNode(c);
last->next = p;
last = p;
p->next = NULL;
}
return head;
}
};