LeetCode---Add Two Numbers

1 题目

链接：点击打开链接

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

2 要注意的地方

(1) 两个list不一定是等长的
(2) 不等长的list没有说如何处理，等到提交后发现，其实是要处理的
(3) 最后两个元素相加可能产生进位，则要新生成一个节点来储存

3 实现（C++）

/**
 * 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) {
         /**
         *  suppose n >= m,
         *  input: a = [a1, a2, .................., an]
         *         b = [b1, b2, ..., bm, bm+1, ..., bn]
         *         where bm+1, ..., bn are possibly zeros
         *  output:
         *         r = [r1, r2, .................., rn]
         *  use pointer result to gather nodes from r such that:
         *  result -> [head, sum(a1, b1), sum(a2, b2), ..., sum(an, bn), last_carry]
         *  where head is there for convenience, and head doesn't contain useful info,
         *  and last_carry could possibly be one.
         * 
         *  therefore the final list should be result->next, which is the starting node
         *  of sum(a1, b1).
         */
        
        ListNode* res = new ListNode(0); 
        ListNode* cur = res;
        int carry = 0,
            sum = 0;
            
        // proceed as l1 and l2 are both not NULL
        while(l1 && l2 ) {
            sum = carry + l1->val + l2->val;
            carry = sum / 10;
            sum = sum % 10;
            ListNode* temp = new ListNode(sum);
            cur->next = temp;
            cur = temp;
            l1 = l1->next;
            l2 = l2->next;
        }
        
        // pick the remaining list that is not NULL
        ListNode* remain = (l1) ? l1 : l2;
        
        // continue until the remaining list is NULL
        while(remain) {
            sum = remain->val + carry;
            carry = sum / 10;
            sum = sum % 10;
            ListNode* temp = new ListNode(sum);
            cur->next = temp;
            cur = temp;
            remain = remain->next;
        }
        
        // deal with the last carry
        if (carry != 0) {
            cur->next = new ListNode(1);
        }
        
        // see the block comment
        return res->next;
    }
};

4 总结

看起来蛮简单的一道题，但是难度是Medium，可能是一些细节的处理吧，本学渣再次发现C++很多语法都忘了orz 好好学习，天天向上。