mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
32 lines
862 B
HTML
32 lines
862 B
HTML
<p>Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 5
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> The binary representation of 5 is: 101
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 7
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> The binary representation of 7 is: 111.</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> n = 11
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> The binary representation of 11 is: 1011.</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 2<sup>31</sup> - 1</code></li>
|
|
</ul>
|