solves binary gap

Author: anishLearnsToCode

README.md

@@ -233,7 +233,7 @@
 | 859 | [Buddy Strings](https://leetcode.com/problems/buddy-strings) | [![Java](assets/java.png)](src/BuddyStrings.java) |
 | 860 | [Lemonade Change](https://leetcode.com/problems/lemonade-change) | [![Java](assets/java.png)](src/LemonadeChange.java) |
 | 867 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix) | [![Java](assets/java.png)](src/TransposeMatrix.java) |
-| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | |
+| 868 | [Binary Gap](https://leetcode.com/problems/binary-gap) | [![Java](assets/java.png)](src/BinaryGap.java) |
 | 872 | [Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees) | |
 | 874 | [Walking Robot Simulation](https://leetcode.com/problems/walking-robot-simulation) | |
 | 876 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list) | |

src/BinaryGap.java

@@ -0,0 +1,15 @@
+public class BinaryGap {
+    public int binaryGap(int n) {
+        int result = Integer.MIN_VALUE, index = 0, prev = -1;
+        while (n > 0) {
+            if ((n & 1) == 1) {
+                if (prev == -1) prev = index;
+                result = Math.max(result, index - prev);
+                prev = index;
+            }
+            n >>= 1;
+            index++;
+        }
+        return result;
+    }
+}