solve problem Binary Number With Alternating Bits

Author: P-ppc

README.md

@@ -16,4 +16,5 @@ All solutions will be accepted!
 |557|[Reverse Words In A String III](https://leetcode-cn.com/problems/reverse-words-in-a-string-iii/description/)|[java/py/js](./algorithms/ReverseWordsInAStringIII)|Easy|
 |104|[Maximum Depth Of Binary Tree](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/description/)|[java/py/js](./algorithms/MaximumDepthOfBinaryTree)|Easy|
 |617|[Merge Two Binary Trees](https://leetcode-cn.com/problems/merge-two-binary-trees/description/)|[java/py/js](./algorithms/MergeTwoBinaryTrees)|Easy|
-|226|[Invert Binary Tree](https://leetcode-cn.com/problems/invert-binary-tree/description/)|[java/py/js]|(./algorithms/InvertBinaryTree)|Easy|
+|226|[Invert Binary Tree](https://leetcode-cn.com/problems/invert-binary-tree/description/)|[java/py/js]|(./algorithms/InvertBinaryTree)|Easy|
+|693|[Binary Number With Alternating Bits](https://leetcode-cn.com/problems/binary-number-with-alternating-bits/description/)|[java/py/js](./algorithms/BinaryNumberWithAlternatingBits)|Easy|

algorithms/BinaryNumberWithAlternatingBits/README.md

@@ -0,0 +1,2 @@
+# Binary Number With Alternating Bits
+We can use bitwise to solve this problem

algorithms/BinaryNumberWithAlternatingBits/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public boolean hasAlternatingBits(int n) {
+        int flag = -1;
+        while (n > 0) {
+            int res = n & 0x01;
+            n >>= 1;
+            if (flag == -1 || flag != res) {
+                flag = res;
+            } else {
+                return false;
+            }
+        }
+        return true;
+    }
+}

algorithms/BinaryNumberWithAlternatingBits/solution.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var hasAlternatingBits = function(n) {
+    let flag = null
+    while (n > 0) {
+        res = n & 0x01
+        n >>= 1
+        if (flag === null || flag !== res) {
+            flag = res
+        } else {
+            return false
+        }
+    }
+    return true
+};

algorithms/BinaryNumberWithAlternatingBits/solution.py

@@ -0,0 +1,16 @@
+class Solution(object):
+    def hasAlternatingBits(self, n):
+        """
+        :type n: int
+        :rtype: bool
+        """
+        flag = None
+        while n > 0:
+            res = n & 0x01
+            n >>= 1
+            if flag is None or flag != res:
+                flag = res
+            else:
+                return False
+            
+        return True