Leetcode#2. Add Two Numbers

题目描述：将两个链表的数字相加，将和作为链表的 val 输出，如：
Input： (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output： 7 -> 0 -> 8

解题思路：

• 模拟加法；
• 注意进位；
• 处理节点遍历完的进位；

/**
 * 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* ret = new ListNode(0);
        ListNode* cur = ret;
        int c = 0;
        int n1, n2;
        while(l1 || l2)
        {
            if(l1)
                n1 = l1->val;
            else
                n1 = 0;
            if(l2)
                n2 = l2->val;
            else
                n2 = 0;
            int sum = n1 + n2 + c;
            c = sum / 10;
            cur->next = new ListNode(sum % 10);
            cur = cur->next;
            if(l1)
                l1 = l1->next;
            if(l2)
                l2 = l2->next;
        }
        if(c)
            cur->next = new ListNode(1);
        return ret->next;
    }
};