链表求和 - C++

class Solution {
public:
    /**
     * @param l1: the first list
     * @param l2: the second list
     * @return: the sum list of l1 and l2 
     */
    ListNode *addLists(ListNode *l1, ListNode *l2) {
        ListNode *aa,*first;
        aa=new ListNode;
        first=aa;
        int comein=0;
        while(l1!=NULL &&l2!=NULL)
        {
            ListNode *bb;
            bb=new ListNode;
            bb->val=((l1->val+l2->val)+comein);
            comein=(l1->val+l2->val+comein)/10;
            aa->next=bb;
            aa=bb;
            l1=l1->next;
            l2=l2->next;
        }
        if(l1==NULL)
        {
            while(l2!=NULL)
            {
                ListNode *tt;
                tt=new ListNode;
                tt->val=(l2->val+comein);
                aa->next=tt;
                c