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

Linked List Math

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
        //此题算比较简单，但是做此题中犯了一个小错，没有为head赋NULL值，以至于在if条件语句中判断head时出现错误，切记编译器不会帮你把指针初始化为NULL的，而只是一个压根就不知道的值
        ListNode *headL, *head = NULL;
        int remain = 0, sum;
        while (l1 && l2)
        {
            sum = l1 -> val + l2 -> val + remain;
            ListNode *node = new ListNode(sum % 10);
            remain = sum / 10;
            if (head == NULL)
            {
                head = node;
                headL = head;
            }
            else
            {
                head -> next = node;
                head = node;
            }
            l1 = l1 -> next;
            l2 = l2 -> next;
        }
        ListNode *head3;
        if (l1)
            head3 = l1;
        else
            head3 = l2;
        while (head3)
        {
            sum = head3 -> val + remain;
            ListNode *node = new ListNode(sum % 10);
            remain = sum / 10;
            if (head == NULL)
            {
                head = node;
                headL = head;
            }
            else
            {
                head -> next = node;
                head = node;
            }
            head3 = head3 -> next;
        }
        if (remain)
            head -> next = new ListNode(remain);
        return headL;
    }