leetcodr_AddTwoNumbers

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) {
               int carry=0;
        if(l1==NULL && l2==NULL)
        return NULL;
        ListNode * head, *p;
        head=new ListNode(-1);
        p=head;
        for(;l1!=NULL && l2!=NULL;)
        {
            int r = (l1->val+l2->val+carry)%10;
            carry = (l1->val+l2->val+carry)/10;
            p->next = new ListNode(r);
            p=p->next;
            l1=l1->next;
            l2=l2->next;
        }
        while(l1!=NULL){
            int r = (l1->val+carry)%10;
            carry = (l1->val+carry)/10;
            p->next = new ListNode(r);
            p=p->next;
            l1=l1->next;
        }
        while(l2!=NULL){
            int r = (l2->val+carry)%10;
            carry = (l2->val+carry)/10;
            p->next = new ListNode(r);
            p=p->next;
            l2=l2->next;
        }
        if(carry){
            p->next = new ListNode(carry);
        }
        return head->next;
    }
};