[C++]LeetCode#2 Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 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) {
        ListNode* head = new ListNode(INT_MIN);
        ListNode* tail = head;
        int carry = 0;
        while(l1||l2){
            carry += l1==NULL?0:l1->val;
            carry += l2==NULL?0:l2->val;
            tail->next = new ListNode(carry%10);
            carry = carry/10;
            tail = tail->next;
            l1 = l1==NULL?NULL:l1->next;
            l2 = l2==NULL?NULL:l2->next;
        }
        if(carry!=0){
            tail->next = new ListNode(carry);
        }
        return head->next;
    }
};