Ai
1 Star 2 Fork 5

LilithSangreal/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
monotone-increasing-digits.py 547 Bytes
一键复制 编辑 原始数据 按行查看 历史
Allen Liu 提交于 2018-10-12 01:33 +08:00 . remove sensitive question description
# Time: O(logn) = O(1)
# Space: O(logn) = O(1)
class Solution(object):
def monotoneIncreasingDigits(self, N):
"""
:type N: int
:rtype: int
"""
nums = map(int, list(str(N)))
leftmost_inverted_idx = len(nums)
for i in reversed(xrange(1, len(nums))):
if nums[i-1] > nums[i]:
leftmost_inverted_idx = i
nums[i-1] -= 1
for i in xrange(leftmost_inverted_idx, len(nums)):
nums[i] = 9
return int("".join(map(str, nums)))
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/LilithSangreal/LeetCode-Solutions.git
git@gitee.com:LilithSangreal/LeetCode-Solutions.git
LilithSangreal
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助