868

Author: ProHiryu

BIT/868.md

@@ -0,0 +1,30 @@
+## Binary Gap
+
+#### Description
+
+[link](https://leetcode.com/problems/binary-gap/)
+
+---
+
+#### Solution
+
+- bin in python
+
+---
+
+#### Code
+
+O(n)
+
+```python
+class Solution:
+    def binaryGap(self, N: int) -> int:
+        s = bin(N)
+        res = 0
+        i = float('inf')
+        for j, n in enumerate(s[2:]):
+            if n == '1':
+                res = max(res, j - i)
+                i = j
+        return res
+```