Skip to content
LC-0738 Medium LeetCode

738. Monotone Increasing Digits

Read the full problem statement on LeetCode.
Difficulty: medium Acceptance: 49% Topics: Math, Greedy
View full problem on LeetCode
Reference solution (spoiler · python)
# 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)))

Solution from kamyu104/LeetCode-Solutions · MIT

Similar questions