zoukankan      html  css  js  c++  java
  • leetcode_66

    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.

    Example 1:

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

    Example 2:

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

    CODE1:  
    class Solution:
        def plusOne(self, digits):
            """
            :type digits: List[int]
            :rtype: List[int]
            """
            if len(digits) == 1 and digits[0] == 9:
                return [1, 0]
    
            if digits[-1] != 9:
                digits[-1] += 1
                return digits
            else:
                digits[-1] = 0
                digits[:-1] = self.plusOne(digits[:-1])
                return digits  
     CODE2: 字符串方法
    class Solution:
        def plusOne(digits):
            return [int(a) for a in (str(int(''.join(map(str, digits))) + 1))]
     
  • 相关阅读:
    REST API注意事项
    Javascript addEventListener dispatchEvent
    Javascript常见操作
    MySql运算符
    Mysql数据类型
    MySql基本命令
    php学习
    javascript学习
    如何快速掌握一种技术
    站在K2角度审视流程--任务的独占与释放
  • 原文地址:https://www.cnblogs.com/francischeng/p/9440883.html
Copyright © 2011-2022 走看看