738.单调递增的数字
class Solution:
def monotoneIncreasingDigits(self, n: int) -> int:
# 先将当前数字n的各位数字输入列表中,方便后续比较
digits = [int(i) for i in list(str(n))]
# 若n为个位数,则直接return n即可
if len(digits) == 1:return n
for i in range(len(digits)-1,0,-1):
if digits[i] <digits[i-1]:
digits[i:] = [9]*(len(digits)-i)
digits[i-1] -= 1
res = 0
for num in digits: res = res*10 +num
return res
968.监控二叉树
暂时跳过