题目：
https://leetcode.com/problems/plus-one/
难度 : Easy
奇怪的AC了
😄
搞笑
class Solution(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
if digits == []:
return [1]
if digits[-1] < 9:
return digits[:-1] + [digits[-1] + 1]
else:
return self.plusOne(digits[:-1]) + [0]
66. Plus One[https://leetcode-cn.com/problems/plus-one/] ...
66. Plus One 题目：https://leetcode.com/problems/plus-one/ 难...
66. Plus One Given a non-negative integer represented as ...
66. Plus One Description Given a non-empty array of digit...
问题链接 66. 加一[https://leetcode-cn.com/problems/plus-one] 问题...
分类：Math/Array 时间复杂度: O(n) 66. Plus One Given a non-empty ...
66. 加一[https://leetcode-cn.com/problems/plus-one/] 解题思路 1...
题目地址(66. 加一) https://leetcode.cn/problems/plus-one/[https...
Problem Given a non-empty array of digits representing a ...
https://leetcode.com/problems/plus-one/description/解题思路：本...
本文标题：66. Plus One
本文链接：https://www.haomeiwen.com/subject/hlnlsttx.html
网友评论