Added task 693.

Author: javadev

src/main/java/g0601_0700/s0693_binary_number_with_alternating_bits/Solution.java

@@ -0,0 +1,18 @@
+package g0601_0700.s0693_binary_number_with_alternating_bits;
+
+// #Easy #Bit_Manipulation
+
+public class Solution {
+ public boolean hasAlternatingBits(int n) {
+ int prev = -1;
+ while (n != 0) {
+ int v = n & 1;
+ n = n >> 1;
+ if (prev == v) {
+ return false;
+ }
+ prev = v;
+ }
+ return true;
+ }
+}

src/main/java/g0601_0700/s0693_binary_number_with_alternating_bits/readme.md

@@ -0,0 +1,33 @@
+693\. Binary Number with Alternating Bits
+
+Easy
+
+Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
+
+**Example 1:**
+
+**Input:** n = 5
+
+**Output:** true
+
+**Explanation:** The binary representation of 5 is: 101 
+
+**Example 2:**
+
+**Input:** n = 7
+
+**Output:** false
+
+**Explanation:** The binary representation of 7 is: 111.
+
+**Example 3:**
+
+**Input:** n = 11
+
+**Output:** false
+
+**Explanation:** The binary representation of 11 is: 1011.
+
+**Constraints:**
+
+* <code>1 <= n <= 2<sup>31</sup> - 1</code>

src/test/java/g0601_0700/s0693_binary_number_with_alternating_bits/SolutionTest.java

@@ -0,0 +1,23 @@
+package g0601_0700.s0693_binary_number_with_alternating_bits;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+ @Test
+ void hasAlternatingBits() {
+ assertThat(new Solution().hasAlternatingBits(5), equalTo(true));
+ }
+
+ @Test
+ void hasAlternatingBits2() {
+ assertThat(new Solution().hasAlternatingBits(7), equalTo(false));
+ }
+
+ @Test
+ void hasAlternatingBits3() {
+ assertThat(new Solution().hasAlternatingBits(11), equalTo(false));
+ }
+}