【leetCode刷题日记】 2.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) {
        ListNode* head = new ListNode(0);
        ListNode* p = head;
        int flag = 0;
        
        while(l1 != NULL || l2 != NULL){
            int v1 = 0;
            if(l1 != NULL){
                v1 = l1->val;
                l1 = l1->next;
            }
            int v2 = 0;
            if(l2 != NULL){
                v2 = l2->val;
                l2 = l2->next;
            }
            int temp = v1 + v2 + flag;
            p->next = new ListNode(temp % 10);
            p = p->next;
            flag = temp/10;
        }
        
        if(flag != 0){
            p->next = new ListNode(flag);
        }
        
        return head->next;
    }
};