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 *sum=new ListNode(0);
ListNode *pre=sum;
int jinwei=0;
while(l1!=NULL||l2!=NULL){
int val1=0,val2=0;
if(l1!=NULL){
val1=l1->val;
l1=l1->next;
}
if(l2!=NULL){
val2=l2->val;
l2=l2->next;
}
int tmp=val1+val2+jinwei;
pre->next=new ListNode(tmp%10);
jinwei=tmp/10;
pre=pre->next;
}
if(jinwei==1){
pre->next=new ListNode(1);
}
return sum->next;
}
};