solves binary numbr with alternatng bits

Author: anishLearnsToCode

README.md

@@ -1,8 +1,8 @@
 # LeetCode Algorithms
 
-![problems-solved](https://img.shields.io/badge/Problems%20Solved-165/2081-1f425f.svg)
-![problems-solved-java](https://img.shields.io/badge/Java-165/2081-1abc9c.svg)
-![problems-solved-python](https://img.shields.io/badge/Python-165/2081-1abc9c.svg)
+![problems-solved](https://img.shields.io/badge/Problems%20Solved-167/2081-1f425f.svg)
+![problems-solved-java](https://img.shields.io/badge/Java-167/2081-1abc9c.svg)
+![problems-solved-python](https://img.shields.io/badge/Python-167/2081-1abc9c.svg)
 [![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen.svg)](CONTRIBUTING.md)
 [![cp](https://img.shields.io/badge/also%20see-Competitve%20Programming-1f72ff.svg)](https://github.com/anishLearnsToCode/competitive-programming)
 
@@ -187,7 +187,7 @@
 | 686 | [Repeated String Match](https://leetcode.com/problems/repeated-string-match) | |
 | 687 | [Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path) | |
 | 690 | [Employee Importance](https://leetcode.com/problems/employee-importance) | |
-| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | |
+| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits) | [![Java](assets/java.png)](src/BinaryNumberWithAlternatingBits.java) [![Python](assets/python.png)](python/binary_number_with_alternating_bits.py) |
 | 696 | [Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings) | |
 | 697 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array) | |
 | 700 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree) | |

python/binary_number_with_alternating_bits.py

@@ -0,0 +1,9 @@
+class Solution:
+    def hasAlternatingBits(self, n: int) -> bool:
+        lastDigit = n % 2
+        while n > 0:
+            n //= 2
+            current = n % 2
+            if lastDigit == current: return False
+            lastDigit = current
+        return True

src/BinaryNumberWithAlternatingBits.java

@@ -0,0 +1,12 @@
+public class BinaryNumberWithAlternatingBits {
+    public boolean hasAlternatingBits(int number) {
+        int lastDigit = number % 2, current;
+        while (number > 0) {
+            number >>= 1;
+            current = number % 2;
+            if (lastDigit == current) return false;
+            lastDigit = current;
+        }
+        return true;
+    }
+}