题目:
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 head(-1);
ListNode *pr = &head, *p=l1, *q=l2;
int carry = 0,sum=0;
for(;p!=NULL||q!=NULL;)
{
if(p!=NULL && q!=NULL)
{
sum = p->val + q->val + carry;
p = p->next;
q = q->next;
}
else if(p==NULL)
{
sum = q->val + carry;
q = q->next;
}
else
{
sum = p->val + carry;
p = p->next;
}
pr->next = new ListNode(sum%10);
carry = sum/10;
pr = pr->next;
}
if(carry)
pr->next = new ListNode(carry);
return head.next;
}
};