【Add Two Numbers】 --MyLeetCode(二)

Description:

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

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