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 {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if(l1==NULL&&l2!=NULL)
            return l2;
        if(l1!=NULL&&l2==NULL)
            return l1;
        int addbit=0;
        ListNode * h = new ListNode(0);
        ListNode *result = h;
        while(l1&&l2)
        {
            if(l1->val+l2->val+addbit>=10)
            {
                
                ListNode *p = new ListNode((l1->val+l2->val+addbit)%10);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 1;
            }
            else
            {
                ListNode *p = new ListNode(l1->val+l2->val+addbit);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 0;
            }
            l1 = l1->next;
            l2 = l2->next;
        }
        while(l1)
        {
            if(l1->val+addbit == 10)
            {
                ListNode *p = new ListNode(0);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 1;
            }
            else
            {
                ListNode * p = new ListNode(l1->val+addbit);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 0;
            }
            l1 = l1->next;
        }
        while(l2)
        {
            if(l2->val+addbit == 10)
            {
                ListNode *p = new ListNode(0);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 1;
            }
            else
            {
                ListNode * p = new ListNode(l2->val+addbit);
                p->next = NULL;
                h->next = p;
                h = h->next;
                addbit = 0;
            }
            l2 = l2->next;
        }
        if(addbit == 1)
        {
                ListNode * p = new ListNode(addbit);
                p->next = NULL;
                h->next = p;
                h = h->next;
        }
        return result->next;
    }
};