feat: add solutions to lc problem: No.0868

No.0868.Binary Gap

Author: YangFong

solution/0800-0899/0868.Binary Gap/README.md

@@ -74,6 +74,48 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+function binaryGap(n: number): number {
+    let res = 0;
+    let j = -1;
+    for (let i = 0; n !== 0; i++) {
+        if (n & 1) {
+            if (j !== -1) {
+                res = Math.max(res, i - j);
+            }
+            j = i;
+        }
+        n >>= 1;
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn binary_gap(mut n: i32) -> i32 {
+        let mut res = 0;
+        let mut i = 0;
+        let mut j = -1;
+        while n != 0 {
+            if n & 1 == 1 {
+                if j != -1 {
+                    res = res.max(i - j);
+                }
+                j = i;
+            }
+            n >>= 1;
+            i += 1;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0868.Binary Gap/README_EN.md

@@ -61,6 +61,48 @@ There are not any adjacent pairs of 1's in the binary representation of 8, s
 
 ```
 
+### **TypeScript**
+
+```ts
+function binaryGap(n: number): number {
+    let res = 0;
+    let j = -1;
+    for (let i = 0; n !== 0; i++) {
+        if (n & 1) {
+            if (j !== -1) {
+                res = Math.max(res, i - j);
+            }
+            j = i;
+        }
+        n >>= 1;
+    }
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn binary_gap(mut n: i32) -> i32 {
+        let mut res = 0;
+        let mut i = 0;
+        let mut j = -1;
+        while n != 0 {
+            if n & 1 == 1 {
+                if j != -1 {
+                    res = res.max(i - j);
+                }
+                j = i;
+            }
+            n >>= 1;
+            i += 1;
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0800-0899/0868.Binary Gap/Solution.rs

@@ -0,0 +1,18 @@
+impl Solution {
+    pub fn binary_gap(mut n: i32) -> i32 {
+        let mut res = 0;
+        let mut i = 0;
+        let mut j = -1;
+        while n != 0 {
+            if n & 1 == 1 {
+                if j != -1 {
+                    res = res.max(i - j);
+                }
+                j = i;
+            }
+            n >>= 1;
+            i += 1;
+        }
+        res
+    }
+}

solution/0800-0899/0868.Binary Gap/Solution.ts

@@ -0,0 +1,14 @@
+function binaryGap(n: number): number {
+    let res = 0;
+    let j = -1;
+    for (let i = 0; n !== 0; i++) {
+        if (n & 1) {
+            if (j !== -1) {
+                res = Math.max(res, i - j);
+            }
+            j = i;
+        }
+        n >>= 1;
+    }
+    return res;
+}