2. 两数相加

给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。

如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。

您可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例：

输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出：7 -> 0 -> 8
原因：342 + 465 = 807

/**
 * 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) {
        if (l1 == NULL) {
            return l2;
        }
        if (l2 == NULL) {
            return l1;
        }
        int carry = 0;
        ListNode* first = l1, *second = l2;
        ListNode* head = new ListNode(0);
        ListNode* node = head;
        while (first && second) {
            int num = first->val + second->val + carry;
            first->val = num % 10;
            node->next = first;
            node = node->next;
            first = first->next;
            second = second->next;
            carry = num / 10;
        }
        if (first) {
            while (carry || first) {
                int sum = first->val + carry;
                first->val = sum % 10;
                node->next = first;
                node = node->next;
                first = first->next;
                carry = sum / 10;
                if (carry == 0 || (first == NULL && carry == 1)) {
                    break;
                }
            }
        }
        if (second) {
            while (carry || second) {
                int sum = second->val + carry;
                second->val = sum % 10;
                node->next = second;
                node = node->next;
                second = second->next;
                carry = sum / 10;
                if (carry == 0 || (second == NULL && carry == 1)) {
                    break;
                }
            }
        }
        if (carry) {
            node->next = new ListNode(carry);
        }
        return head->next;
    }
};