feat: add solutions to lc problem: No.1016

No.1016.Binary String With Substrings Representing 1 To N

Author: yanglbme

solution/1000-1099/1016.Binary String With Substrings Representing 1 To N/README.md

@@ -40,7 +40,9 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-4（100）存在的话，2（10）一定存在。`n` 存在的话，`n >> 1` 也一定存在，所以只需要判断 `[n/2+1, n]` 范围的数字
+**方法一：数学**
+
+4（100）存在的话，2（10）一定存在。`n` 存在的话，`n >> 1` 也一定存在，所以只需要判断 `[n/2+1, n]` 范围的数字。
 
 <!-- tabs:start -->
 
@@ -57,6 +59,12 @@ class Solution:
         return True
 ```
 
+```python
+class Solution:
+    def queryString(self, s: str, n: int) -> bool:
+        return all(bin(i)[2:] in s for i in range(1, n + 1))
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
@@ -74,6 +82,19 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public boolean queryString(String s, int n) {
+        for (int i = 1; i <= n; ++i) {
+            if (!s.contains(Integer.toBinaryString(i))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
 ### **Go**
 
 ```go
@@ -87,6 +108,17 @@ func queryString(s string, n int) bool {
 }
 ```
 
+```go
+func queryString(s string, n int) bool {
+	for i := 1; i <= n; i++ {
+		if !strings.Contains(s, strconv.FormatInt(int64(i), 2)) {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -103,6 +135,33 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    bool queryString(string s, int n) {
+        for (int i = 1; i <= n; ++i) {
+            string b = bitset<32>(i).to_string();
+            b = b.substr(b.find_first_not_of('0'));
+            if (s.find(b) == string::npos) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **TypeScript**
+
+```ts
+function queryString(s: string, n: number): boolean {
+    for (let i = 1; i <= n; ++i) {
+        if (s.indexOf(i.toString(2)) === -1) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1016.Binary String With Substrings Representing 1 To N/README_EN.md

@@ -40,6 +40,12 @@ class Solution:
         return True
 ```
 
+```python
+class Solution:
+    def queryString(self, s: str, n: int) -> bool:
+        return all(bin(i)[2:] in s for i in range(1, n + 1))
+```
+
 ### **Java**
 
 ```java
@@ -55,6 +61,19 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public boolean queryString(String s, int n) {
+        for (int i = 1; i <= n; ++i) {
+            if (!s.contains(Integer.toBinaryString(i))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
 ### **Go**
 
 ```go
@@ -68,6 +87,17 @@ func queryString(s string, n int) bool {
 }
 ```
 
+```go
+func queryString(s string, n int) bool {
+	for i := 1; i <= n; i++ {
+		if !strings.Contains(s, strconv.FormatInt(int64(i), 2)) {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -84,6 +114,33 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    bool queryString(string s, int n) {
+        for (int i = 1; i <= n; ++i) {
+            string b = bitset<32>(i).to_string();
+            b = b.substr(b.find_first_not_of('0'));
+            if (s.find(b) == string::npos) return false;
+        }
+        return true;
+    }
+};
+```
+
+### **TypeScript**
+
+```ts
+function queryString(s: string, n: number): boolean {
+    for (let i = 1; i <= n; ++i) {
+        if (s.indexOf(i.toString(2)) === -1) {
+            return false;
+        }
+    }
+    return true;
+}
+```
+
 ### **...**
 
 ```

solution/1000-1099/1016.Binary String With Substrings Representing 1 To N/Solution.ts

@@ -0,0 +1,8 @@
+function queryString(s: string, n: number): boolean {
+    for (let i = 1; i <= n; ++i) {
+        if (s.indexOf(i.toString(2)) === -1) {
+            return false;
+        }
+    }
+    return true;
+}