1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 12:06:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions

View File

@@ -0,0 +1,33 @@
<p>给定一个正整数,检查它的二进制表示是否总是 0、1 交替出现:换句话说,就是二进制表示中相邻两位的数字永不相同。</p>
<p>&nbsp;</p>
<p><strong>示例 1</strong></p>
<pre>
<strong>输入:</strong>n = 5
<strong>输出:</strong>true
<strong>解释:</strong>5 的二进制表示是101
</pre>
<p><strong>示例 2</strong></p>
<pre>
<strong>输入:</strong>n = 7
<strong>输出:</strong>false
<strong>解释:</strong>7 的二进制表示是111.</pre>
<p><strong>示例 3</strong></p>
<pre>
<strong>输入:</strong>n = 11
<strong>输出:</strong>false
<strong>解释:</strong>11 的二进制表示是1011.</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>
</ul>