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
342 + 465 = 807
通常计算是向前进位,在此向后进位
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2)
{
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
ListNode* newhead = new ListNode(0);
ListNode* cur = newhead;
int sum = 0;
while (l1 != NULL || l2 != NULL || sum>0)
{
if (l1)
{
sum = sum + l1->val;
l1 = l1->next;
}
if (l2)
{
sum = sum + l2->val;
l2 = l2->next;
}
cur->next = new ListNode(sum % 10);
sum = sum / 10;
cur = cur->next;
}
return newhead->next;
}