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

思路：当l1和l2或者carry!=0的时候，需要计算l1->val+l2->val+carry的３个元素的和的值，作为对应位置的节点。具体在运算的时候，需要判断当有链表已经相加到结尾的时候，这个时候原来相加的元素可能变成２个或者１个。当链表相加结束且进位为０的时候表示两个链表相加结束。

代码如下所示：

/**
 * 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 *res=new ListNode(0),*p=res;
        int carry=0;
        while(l1||l2||carry)
        {
            if(l1)
            {
                carry+=l1->val;
                l1=l1->next;
            }
            if(l2)
            {
                carry+=l2->val;
                l2=l2->next;
            }
            p->next=new ListNode(carry%10);
            p=p->next;
            carry/=10;
        }
        return res->next;
    }
};