coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 09:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

first commit

Browse Source
This commit is contained in:
小墨
2022-03-27 18:35:17 +08:00
commit 19f9daa313
2293 changed files with 332967 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
算法题/monotone-increasing-digits.html Normal file
View File

@@ -0,0 +1,32 @@
<p>An integer has <strong>monotone increasing digits</strong> if and only if each pair of adjacent digits <code>x</code> and <code>y</code> satisfy <code>x &lt;= y</code>.</p>
<p>Given an integer <code>n</code>, return <em>the largest number that is less than or equal to </em><code>n</code><em> with <strong>monotone increasing digits</strong></em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> n = 10
<strong>Output:</strong> 9
</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> n = 1234
<strong>Output:</strong> 1234
</pre>
<p><strong>Example 3:</strong></p>
<pre>
<strong>Input:</strong> n = 332
<strong>Output:</strong> 299
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>0 &lt;= n &lt;= 10<sup>9</sup></code></li>
</ul>