LeetCode2. Add Two Numbers

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

Runtime: 76 ms

#include<iostream>
using namespace std;
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(-1);
        ListNode *g=new ListNode(1);
        ListNode* tmp=head;
        int d=0;
        int sum=0;
        while(l1||l2){                      
            if(l1&&l2){             
                sum=l1->val+l2->val+d;
                tmp->next=l1;
                l1=l1->next;
                l2=l2->next;                    
            }
            else if(l1){
                tmp->next=l1;
                sum=l1->val+d;
                l1=l1->next;
            }
            else if(l2){
                tmp->next=l2;
                sum=l2->val+d;
                l2=l2->next;

            }
            tmp=tmp->next;
            if(sum>=10){
                d=1;
                sum-=10;
                tmp->val=sum;
            }
            else{
                d=0;
                tmp->val=sum;
            }
        }
        if(d==1){   
           tmp->next=g; 
        }
        return head->next;
    }
};

void main(){
    ListNode L1(5);
    ListNode L2(9);
    ListNode L3(9);
    ListNode L4(5);
    ListNode L5(9);
    ListNode L6(9);
    //L1.next=&L2;
    //L2.next=&L3;

    L4.next=&L5;
    L5.next=&L6;

    Solution So;
    ListNode* p1=&L1;
    ListNode* p2=&L4;
    ListNode* p=So.addTwoNumbers(p1,p2);

    while(p!=NULL){
        cout<<"main "<<p->val<<endl;
        p=p->next;
    }
}