feat: add solutions to lc problem: No.1016

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

Author: maolonglong

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

@@ -40,22 +40,67 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+4（100）存在的话，2（10）一定存在。`n` 存在的话，`n >> 1` 也一定存在，所以只需要判断 `[n/2+1, n]` 范围的数字
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def queryString(self, s: str, n: int) -> bool:
+        for i in range(n, n // 2, -1):
+            if bin(i)[2:] not in s:
+                return False
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean queryString(String s, int n) {
+        for (int i = n; i > n / 2; i--) {
+            if (!s.contains(Integer.toBinaryString(i))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+### **Go**
+
+```go
+func queryString(s string, n int) bool {
+	for i := n; i > n/2; i-- {
+		if !strings.Contains(s, strconv.FormatInt(int64(i), 2)) {
+			return false
+		}
+	}
+	return true
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool queryString(string s, int n) {
+        for (int i = n; i > n / 2; --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;
+    }
+};
 ```
 
 ### **...**

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

@@ -32,13 +32,56 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def queryString(self, s: str, n: int) -> bool:
+        for i in range(n, n // 2, -1):
+            if bin(i)[2:] not in s:
+                return False
+        return True
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public boolean queryString(String s, int n) {
+        for (int i = n; i > n / 2; i--) {
+            if (!s.contains(Integer.toBinaryString(i))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+### **Go**
+
+```go
+func queryString(s string, n int) bool {
+	for i := n; i > n/2; i-- {
+		if !strings.Contains(s, strconv.FormatInt(int64(i), 2)) {
+			return false
+		}
+	}
+	return true
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool queryString(string s, int n) {
+        for (int i = n; i > n / 2; --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;
+    }
+};
 ```
 
 ### **...**

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

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    bool queryString(string s, int n) {
+        for (int i = n; i > n / 2; --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;
+    }
+};

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

@@ -0,0 +1,8 @@
+func queryString(s string, n int) bool {
+	for i := n; i > n/2; i-- {
+		if !strings.Contains(s, strconv.FormatInt(int64(i), 2)) {
+			return false
+		}
+	}
+	return true
+}

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

@@ -0,0 +1,10 @@
+class Solution {
+    public boolean queryString(String s, int n) {
+        for (int i = n; i > n / 2; i--) {
+            if (!s.contains(Integer.toBinaryString(i))) {
+                return false;
+            }
+        }
+        return true;
+    }
+}

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

@@ -0,0 +1,6 @@
+class Solution:
+    def queryString(self, s: str, n: int) -> bool:
+        for i in range(n, n // 2, -1):
+            if bin(i)[2:] not in s:
+                return False
+        return True