Add Two Numbers
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
正确简单才是王道!
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
ListNode* ret = NULL;
ListNode** cur = &ret;
int carry = 0;
int sum = 0;
while(l1 != NULL || l2 != NULL)
{
sum = carry;
if(l1 != NULL)
{
sum += l1->val;
l1 = l1->next;
}
if(l2 != NULL)
{
sum += l2->val;
l2 = l2->next;
}
carry = sum/10;
sum %= 10;
*cur = new ListNode(sum);
cur = &(*cur)->next;
}
if(carry > 0)
*cur = new ListNode(carry);
return ret;
}
};