Add Two Numbers 链表相加

/**
 * 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) {
        int carry=0;
int sum=0;
ListNode *head=new ListNode(-1);
ListNode *curr=head;
while(l1&&l2)
{
int l1val=l1->val;
   int l2val=l2->val;
l1=l1->next;
l2=l2->next;
sum=l1val+l2val+carry;
carry=sum/10;
sum%=10;
curr->next=new ListNode(sum);
   curr=curr->next;
}
while(l1)
{
   int  l1val=l1->val;
l1=l1->next;
sum=carry+l1val;
carry=sum/10;
sum%=10;
curr->next=new ListNode(sum);
curr=curr->next;
}


while(l2)
{
int l2val=l2->val;
l2=l2->next;
sum=l2val+carry;
carry=sum/10;
sum%=10;
curr->next=new ListNode(sum);
curr=curr->next;
}


if(carry>0)
{//注意一定是curr->next来新建节点，千万不是curr.
curr->next=new ListNode(carry);
}
   ListNode  *t=head->next;
   return t;
    }
};