mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 21:16:45 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个正整数 <code>n</code> ,你可以做如下操作:</p>\n\n<ol>\n\t<li>如果 <code>n</code><em> </em>是偶数,则用 <code>n / 2</code>替换 <code>n</code><em> </em>。</li>\n\t<li>如果 <code>n</code><em> </em>是奇数,则可以用 <code>n + 1</code>或<code>n - 1</code>替换 <code>n</code> 。</li>\n</ol>\n\n<p>返回 <code>n</code><em> </em>变为 <code>1</code> 所需的 <em>最小替换次数</em> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 8\n<strong>输出:</strong>3\n<strong>解释:</strong>8 -> 4 -> 2 -> 1\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 7\n<strong>输出:</strong>4\n<strong>解释:</strong>7 -> 8 -> 4 -> 2 -> 1\n或 7 -> 6 -> 3 -> 2 -> 1\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 4\n<strong>输出:</strong>2\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 225,
|
||||
"likes": 232,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"52.6K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 52591, \"totalSubmissionRaw\": 122179, \"acRate\": \"43.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"54K\", \"totalSubmission\": \"125.8K\", \"totalAcceptedRaw\": 54034, \"totalSubmissionRaw\": 125770, \"acRate\": \"43.0%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user