1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一个正整数,检查它的二进制表示是否总是 0、1 交替出现:换句话说,就是二进制表示中相邻两位的数字永不相同。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 5\n<strong>输出:</strong>true\n<strong>解释:</strong>5 的二进制表示是101\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 7\n<strong>输出:</strong>false\n<strong>解释:</strong>7 的二进制表示是111.</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 11\n<strong>输出:</strong>false\n<strong>解释:</strong>11 的二进制表示是1011.</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 116,
"likes": 198,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of 1 Bits\", \"titleSlug\": \"number-of-1-bits\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4f4d1\\u7684\\u4e2a\\u6570\"}]",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30.3K\", \"totalSubmission\": \"49.8K\", \"totalAcceptedRaw\": 30270, \"totalSubmissionRaw\": 49757, \"acRate\": \"60.8%\"}",
"stats": "{\"totalAccepted\": \"65.9K\", \"totalSubmission\": \"100.7K\", \"totalAcceptedRaw\": 65895, \"totalSubmissionRaw\": 100711, \"acRate\": \"65.4%\"}",
"hints": [],
"solution": null,
"status": null,