LeetCode算法题目：Add-Two-Number解决

题目：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.

题目在LeetCode中难度中等，解题思路很明确，首先实例化一个链表head和一个为零的变量carry，然后按照顺序读取两个链表中的数据和此变量求和，将其和与10取余得到的值插入新创建的链表中，与10取模将得到的值与新读取到的两链表值求和一直循环下去直到较长的链表结束，若此时carry！=0，则将carry的值插入到head中，并返回head，其中要注意当较短链表结束时其值用0替代。

实现代码如下：

class Solution {
public:
   ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *head = new ListNode(0);
        ListNode *ptr = head;
        int carry = 0;
        while (true) {
            if (l1 != NULL) {
                carry += l1->val;
                l1 = l1->next;
            }
            if (l2 != NULL) {
                carry += l2->val;
                l2 = l2->next;
            }
            ptr->val = carry % 10;
            carry /= 10;
            // 当两个表非空或者仍有进位时需要继续运算，否则退出循环
            if (l1 != NULL || l2 != NULL || carry != 0) {
                ptr = (ptr->next = new ListNode(0));
            } else break;
        }
        return head;
    }
};