Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 738 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 738 # by problem number
lcpy gen -s monotone_increasing_digits # by problem name
x and y satisfy x <= y.
Given an integer n, return the largest number that is less than or equal to n with monotone increasing digits.
Input: n = 10
Output: 9
Input: n = 1234
Output: 1234
Input: n = 332
Output: 299
0 <= n <= 10^9class Solution:
# Time: O(d) where d is the number of digits in n
# Space: O(d)
def monotone_increasing_digits(self, n: int) -> int:
digits = list(str(n))
for i in range(len(digits) - 1):
if digits[i] > digits[i + 1]:
while i > 0 and digits[i - 1] == digits[i]:
i -= 1
digits[i] = str(int(digits[i]) - 1)
for j in range(i + 1, len(digits)):
digits[j] = "9"
break
return int("".join(digits))
| Time | Space |
|---|---|
| O(d) where d is the number of digits in n | O(d) |