数字列表加一生成新的数字列表

https://leetcode.com/problems/plus-one/

Description

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

给一个数字列表，例如123 –> [1, 2, 3]，算出来这个数加一之后的新列表，也就是123+1=124 –> [1, 2, 4]，这课题应该要考的情况是逢9需进位的情况，但是用 python 字典转字符串再强制类型转换直接加一，再强制字符串转数组，就避免了这个问题。（用 Python 好像开了挂）

Example

Example One

1
2
3
Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example Two

1
2
3
Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

Answer

1
2
3
4
5
6
7
class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        return map(int, list(str(int(''.join(map(str, digits))) + 1)))