面试02.05 链表求和

示例：

输入：(7 -> 1 -> 6) + (5 -> 9 -> 2)，即617 + 295
输出：2 -> 1 -> 9，即912

最麻烦的代码，最易理解的思路；

/**
 * 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) {
        int sum = 0;
        int canny = 0;
        ListNode *dummy = new ListNode(0);
        ListNode *node = new ListNode(0);
        dummy->next = node;
        while(l1 && l2){
            sum = (l1->val+l2->val+canny)%10; //获取个位数字
            canny = (l1->val+l2->val+canny)/10; //获取进位数字
            ListNode *cur = new ListNode(sum);//node->next  // cur
            node->next = cur;
            node = cur;
            l1= l1 ->next;
            l2 = l2->next;
        }
        while(l1){
            sum = (l1->val+canny)%10;
            canny = (l1->val+canny)/10;
            ListNode *cur1 = new ListNode(sum);
            node->next = cur1;
            node = cur1;
            l1 = l1->next;
        }
        while(l2){
            sum = (l2->val+canny)%10;
            canny = (l2->val+canny)/10;
            ListNode *cur2 = new ListNode(sum);
            node->next = cur2;
            node = cur2;
            l2 = l2->next;
        }
        if(canny == 1){
            ListNode *cur3 = new ListNode(1);
            node->next = cur3;
        }
        return dummy->next->next;

    }
};