【2】Add Two Numbers

链表基础题

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

逐位（节点）相加，注意做好进位即可

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
    ListNode* lsum=new ListNode(0);
    ListNode* lHead=lsum;
    int c=0;
    while(l1 || l2){
        if(l1 && l2){
            int sum=l1->val+l2->val+c;
            lsum->next=new ListNode(sum%10);
            lsum=lsum->next;
            l1=l1->next;
            l2=l2->next;
            c=sum/10;
        }
        else if(l1){
            int sum=l1->val+c;
            lsum->next=new ListNode(sum%10);
            lsum=lsum->next;
            l1=l1->next;
            c=sum/10;
        }
        else {
            int sum=l2->val+c;
            lsum->next=new ListNode(sum%10);
            lsum=lsum->next;
            l2=l2->next;
            c=sum/10;
        }
    }
    if(c>0)lsum->next=new ListNode(c);
    return lHead->next;
}