mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>当且仅当每个相邻位数上的数字 <code>x</code> 和 <code>y</code> 满足 <code>x <= y</code> 时,我们称这个整数是<strong>单调递增</strong>的。</p>\n\n<p>给定一个整数 <code>n</code> ,返回 <em>小于或等于 <code>n</code> 的最大数字,且数字呈 <strong>单调递增</strong></em> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 10\n<strong>输出:</strong> 9\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 1234\n<strong>输出:</strong> 1234\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong> n = 332\n<strong>输出:</strong> 299\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>0 <= n <= 10<sup>9</sup></code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 242,
|
||||
"likes": 249,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Remove K Digits\", \"titleSlug\": \"remove-k-digits\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u79fb\\u6389 K \\u4f4d\\u6570\\u5b57\"}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"104.7K\", \"totalAcceptedRaw\": 52344, \"totalSubmissionRaw\": 104688, \"acRate\": \"50.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"55.7K\", \"totalSubmission\": \"111.5K\", \"totalAcceptedRaw\": 55725, \"totalSubmissionRaw\": 111540, \"acRate\": \"50.0%\"}",
|
||||
"hints": [
|
||||
"Build the answer digit by digit, adding the largest possible one that would make the number still less than or equal to N."
|
||||
],
|
||||
|
Reference in New Issue
Block a user