[Leetcode]之Add Two Numbers

最近要刷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.

例子：

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 * c1 = l1;
        ListNode * c2 = l2;
        ListNode * d= new ListNode(0);  // 头结点
        ListNode * head = d;   
        int carry = 0;  // 进位
        
        
        while (c1 != NULL || c2 != NULL)  // c1、c2为初始时的个位数字
        {
            int sum = 0;
            if (c1)
            {
                sum += c1->val;
                c1 = c1->next;
            }
            if (c2)
            {
                sum += c2->val;
                c2 = c2->next;
            }
            int tem = sum + carry;
            carry = tem / 10;  //进位
            d->next = new ListNode(tem % 10);
            d = d->next;  // 头结点指向之前操作的链表的节点
        }
        
        if (carry != 0)
            d->next = new ListNode(carry);
        
        return head->next;
        
    }
};