Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 7.6 MB (99.82%)

Author: koralkulacoglu

LeetCode/0693-binary-number-with-alternating-bits/README.md

@@ -0,0 +1,31 @@
+<p>Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.</p>
+
+<p>&nbsp;</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>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= n &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>

LeetCode/0693-binary-number-with-alternating-bits/solution.cpp

@@ -0,0 +1,7 @@
+class Solution {
+public:
+    bool hasAlternatingBits(int n) {
+        while (n) if ((n & 1) == ((n >>= 1) & 1)) return false;
+        return true;
+    }
+};