leetcode: 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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
int getListLen(ListNode *node)
{
    if (!node)
        return 0;
        
    int len = 0;
    
    ListNode *p = node;
    while (p)
    {
        len++;
        p = p->next;
    }
    return len;
}
    
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function        
        if (l1== NULL && l2 == NULL)
            return NULL;
        else if (l1 == NULL)
            return l2;
        else if (l2 == NULL)
            return l1;
            
        ListNode *p1;
        ListNode *p2;
        ListNode *head;
        
        if (getListLen(l1) >= getListLen(l2))
        {
            p1 = l1;
            p2 = l2;
        }
        else
        {
            p1 = l2;
            p2 = l1;
        }
        head = p1;
        
        int increase = 0;
        int sum = 0;
        while (p2->next)
        {
            sum = p1->val + p2->val + increase;
            p1->val  = sum%10;
            increase = sum>=10? 1:0;
               
            p1 = p1->next;
            p2 = p2->next;
        }
        
        sum = p1->val + p2->val + increase;
        p1->val = sum%10;
        increase = sum>=10? 1:0;
        
        while (p1->next)
        {
            p1 = p1->next;
            
            sum = p1->val + increase;
            p1->val = sum%10;
            increase = sum>=10? 1:0;
        }
        
        if (increase)
        {
            p1->next = new ListNode(increase);
        }
        
        return head;   
    }
};

其他解法

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        int overflow = 0;
        ListNode *ret = NULL;
        ListNode **pnode = &ret;
        while(l1 && l2) {
            int val = l1->val + l2->val + overflow;
            overflow = val / 10;
            *pnode = new ListNode(val % 10);
            pnode = &((*pnode)->next);
            l1 = l1->next;
            l2 = l2->next;
        }
        ListNode *lremain = l1 ? l1 : l2;
        while(lremain) {
            int val = lremain->val + overflow;
            overflow = val / 10;
            *pnode = new ListNode(val % 10);
            pnode = &((*pnode)->next);
            lremain = lremain->next;
        }
        if(overflow > 0) {
            *pnode = new ListNode(overflow);
        }
        return ret;
    }
};