leetcode Add two number C++

Question:Add two number(Medium)

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.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

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

/**
 * 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*ResultlistHead=new ListNode(0);
            ListNode*Resultlistcurrent=ResultlistHead;
            int H=0;
            ListNode*current1=l1;ListNode*current2=l2;
            while(current1!=0&&current2!=0)
            {
                ListNode*p=new ListNode((current1->val+current2->val+H)%10);
                Resultlistcurrent->next=p;
                Resultlistcurrent=Resultlistcurrent->next;
                H=((current1->val+current2->val+H)>=10);
                current1=current1->next;
                current2=current2->next;
            }
            if(current1==0&&current2==0&&H==1)
            {
                ListNode*p=new ListNode(1);   
                Resultlistcurrent->next=p;
                Resultlistcurrent=Resultlistcurrent->next;
            }
            else if(current2==0&&current1!=0)
            {
                ListNode*p=new ListNode((H+(current1->val))%10);
                Resultlistcurrent->next=p;
                Resultlistcurrent=Resultlistcurrent->next;
                H=((current1->val)+H>=10);
                current1=current1->next;
                while(current1!=0)
                {
                    ListNode*p=new ListNode(((current1->val)+H)%10);
                    Resultlistcurrent->next=p;
                    Resultlistcurrent=Resultlistcurrent->next;
                    H=(((current1->val)+H)>=10);
                    current1=current1->next;
                }
                if(H==1)
                {
                    ListNode*p=new ListNode(1);
                    Resultlistcurrent->next=p;
                    Resultlistcurrent=Resultlistcurrent->next;
                }
            }
            else if(current1==0&&current2!=0)
            {
                ListNode*p=new ListNode((H+(current2->val))%10);
                Resultlistcurrent->next=p;
                Resultlistcurrent=Resultlistcurrent->next;
                 H=((current2->val)+H>=10);
                current2=current2->next;
                while(current2!=0)
                {
                    ListNode*p=new ListNode(((current2->val)+H)%10);
                    Resultlistcurrent->next=p;
                    Resultlistcurrent=Resultlistcurrent->next;
                    H=(((current2->val)+H)>=10);
                    current2=current2->next;
                }
                if(H==1)
                {
                    ListNode*p=new ListNode(1);
                    Resultlistcurrent->next=p;
                    Resultlistcurrent=Resultlistcurrent->next;
                }
            }
            ListNode*DeleteNode;
            DeleteNode=ResultlistHead;
            ResultlistHead=ResultlistHead->next;
            delete DeleteNode;
            return ResultlistHead;
    }
};