g0701_0800.s0738_monotone_increasing_digits.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
738\. Monotone Increasing Digits
Medium
An integer has **monotone increasing digits** if and only if each pair of adjacent digits `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**_.
**Example 1:**
**Input:** n = 10
**Output:** 9
**Example 2:**
**Input:** n = 1234
**Output:** 1234
**Example 3:**
**Input:** n = 332
**Output:** 299
**Constraints:**
* 0 <= n <= 109