大整数相加--链表结构

/** 
<pre code_snippet_id="2396698" snippet_file_name="blog_20170516_1_5100708" name="code" class="cpp"> * 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* head=new ListNode(-1);  
        ListNode* p=head;  
        if(l1==NULL||l2==NULL)return head;  
        int c=0;  
        int val1,val2;  
        while(l1||l2)  
        {  
            val1=l1==NULL?0:l1->val;  
            val2=l2==NULL?0:l2->val;  
            p->next=new ListNode((val1+val2+c)%10);  
            p=p->next;  
            c=(val1+val2+c)/10;  
            l1=l1==NULL?NULL:l1->next;  
            l2=l2==NULL?NULL:l2->next;  
        }  
        if(c==1)  
        {  
            p->next=new ListNode(1);  
        }  
        return head->next;  
    }  
};