update: 添加问题“1461.检查一个字符串是否包含所有长度为K的二进制子串”的代码和题解 (#1407)

1461: AC.cpp (#1406) - AC,40.08%,36.38%

Signed-off-by: LetMeFly666 <Tisfy@qq.com>

Author: LetMeFly666

.commitmsg

@@ -0,0 +1 @@
+1461: AC.cpp (#1406) - AC,40.08%,36.38%

Codes/1461-check-if-a-string-contains-all-binary-codes-of-size-k.cpp

@@ -0,0 +1,22 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-23 11:30:05
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-23 11:37:00
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+// THIS CANNOT BE ACCEPTED
+class Solution {
+public:
+    bool hasAllCodes(string s, int k) {
+        unordered_set<string> ma;
+        for (int i = 0, n = s.size(); i < n; i++) {
+            for (int l = 1; l <= k && i + l <= n; l++) {
+                ma.insert(s.substr(i, l));
+            }
+        }
+        return ma.size() == (1 << k);
+    }
+};

Codes/1461-check-if-a-string-contains-all-binary-codes-of-size-k_AC.cpp

@@ -0,0 +1,20 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2026-02-23 11:30:05
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2026-02-23 11:37:10
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    bool hasAllCodes(string s, int k) {
+        unordered_set<string> ma;
+        for (int i = 0, to = s.size() - k + 1; i < to; i++) {
+            ma.insert(s.substr(i, k));
+        }
+        return ma.size() == (1 << k);
+    }
+};

README.md

@@ -592,6 +592,7 @@
 |1457.二叉树中的伪回文路径|中等|<a href="https://leetcode.cn/problems/pseudo-palindromic-paths-in-a-binary-tree/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/11/25/LeetCode%201457.%E4%BA%8C%E5%8F%89%E6%A0%91%E4%B8%AD%E7%9A%84%E4%BC%AA%E5%9B%9E%E6%96%87%E8%B7%AF%E5%BE%84/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134617854" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/pseudo-palindromic-paths-in-a-binary-tree/solutions/2541535/letmefly-1457er-cha-shu-zhong-de-wei-hui-91vp/" target="_blank">LeetCode题解</a>|
 |1458.两个子序列的最大点积|困难|<a href="https://leetcode.cn/problems/max-dot-product-of-two-subsequences/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/01/08/LeetCode%201458.%E4%B8%A4%E4%B8%AA%E5%AD%90%E5%BA%8F%E5%88%97%E7%9A%84%E6%9C%80%E5%A4%A7%E7%82%B9%E7%A7%AF/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/156713484" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/max-dot-product-of-two-subsequences/solutions/3875454/letmefly-1458liang-ge-zi-xu-lie-de-zui-d-3f54/" target="_blank">LeetCode题解</a>|
 |1460.通过翻转子数组使两个数组相等|简单|<a href="https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-sub-arrays/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/24/LeetCode%201460.%E9%80%9A%E8%BF%87%E7%BF%BB%E8%BD%AC%E5%AD%90%E6%95%B0%E7%BB%84%E4%BD%BF%E4%B8%A4%E4%B8%AA%E6%95%B0%E7%BB%84%E7%9B%B8%E7%AD%89/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126499790" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-sub-arrays/solution/letmefly-1460tong-guo-fan-zhuan-zi-shu-z-q812/" target="_blank">LeetCode题解</a>|
+|1461.检查一个字符串是否包含所有长度为K的二进制子串|中等|<a href="https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2026/02/23/LeetCode%201461.%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E9%95%BF%E5%BA%A6%E4%B8%BAK%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/158315342" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/solutions/3906737/letmefly-1461jian-cha-yi-ge-zi-fu-chuan-fs9a3/" target="_blank">LeetCode题解</a>|
 |1462.课程表IV|中等|<a href="https://leetcode.cn/problems/course-schedule-iv/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/09/12/LeetCode%201462.%E8%AF%BE%E7%A8%8B%E8%A1%A8IV/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/132825649" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/course-schedule-iv/solutions/2438404/letmefly-1462ke-cheng-biao-ivtuo-bu-pai-gufke/" target="_blank">LeetCode题解</a>|
 |1464.数组中两元素的最大乘积|简单|<a href="https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2022/08/26/LeetCode%201464.%E6%95%B0%E7%BB%84%E4%B8%AD%E4%B8%A4%E5%85%83%E7%B4%A0%E7%9A%84%E6%9C%80%E5%A4%A7%E4%B9%98%E7%A7%AF/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/126536351" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-product-of-two-elements-in-an-array/solution/letmefly-1464shu-zu-zhong-liang-yuan-su-txf8l/" target="_blank">LeetCode题解</a>|
 |1465.切割后面积最大的蛋糕|中等|<a href="https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/10/27/LeetCode%201465.%E5%88%87%E5%89%B2%E5%90%8E%E9%9D%A2%E7%A7%AF%E6%9C%80%E5%A4%A7%E7%9A%84%E8%9B%8B%E7%B3%95/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134073948" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/solutions/2500697/letmefly-1465qie-ge-hou-mian-ji-zui-da-d-xqai/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 1461.检查一个字符串是否包含所有长度为K的二进制子串.md

@@ -0,0 +1,83 @@
+---
+title: 1461.检查一个字符串是否包含所有长度为 K 的二进制子串：哈希表存放所有长度为k的子串
+date: 2026-02-23 11:39:33
+tags: [题解, LeetCode, 中等, 位运算, 哈希表, 字符串, 暴力, 枚举]
+categories: [题解, LeetCode]
+---
+
+# 【LetMeFly】1461.检查一个字符串是否包含所有长度为 K 的二进制子串：哈希表存放所有长度为k的子串
+
+力扣题目链接：[https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/](https://leetcode.cn/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)
+
+<p>给你一个二进制字符串&nbsp;<code>s</code>&nbsp;和一个整数&nbsp;<code>k</code>&nbsp;。如果所有长度为 <code>k</code>&nbsp;的二进制字符串都是 <code>s</code>&nbsp;的子串，请返回 <code>true</code> ，否则请返回 <code>false</code> 。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "00110110", k = 2
+<strong>输出：</strong>true
+<strong>解释：</strong>长度为 2 的二进制串包括 "00"，"01"，"10" 和 "11"。它们分别是 s 中下标为 0，1，3，2 开始的长度为 2 的子串。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "0110", k = 1
+<strong>输出：</strong>true
+<strong>解释：</strong>长度为 1 的二进制串包括 "0" 和 "1"，显然它们都是 s 的子串。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "0110", k = 2
+<strong>输出：</strong>false
+<strong>解释：</strong>长度为 2 的二进制串 "00" 没有出现在 s 中。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 5 * 10<sup>5</sup></code></li>
+	<li><code>s[i]</code> 不是<code>'0'</code> 就是 <code>'1'</code></li>
+	<li><code>1 &lt;= k &lt;= 20</code></li>
+</ul>
+
+
+    
+## 解题方法：暴力枚举
+
+使用一个哈希表，存放所有长度为$k$的子串。
+
+最后看看哈希表中子串数量是否等于$2^k$。
+
++ 时间复杂度$O((len(s) - k)\times k)$
++ 空间复杂度$O((len(s) - k)\times k)$
+
+### AC代码
+
+#### C++
+
+```cpp
+/*
+ * @LastEditTime: 2026-02-23 11:37:10
+ */
+class Solution {
+public:
+    bool hasAllCodes(string s, int k) {
+        unordered_set<string> ma;
+        for (int i = 0, to = s.size() - k + 1; i < to; i++) {
+            ma.insert(s.substr(i, k));
+        }
+        return ma.size() == (1 << k);
+    }
+};
+```
+
+> 同步发文于[CSDN](https://letmefly.blog.csdn.net/article/details/158315342)和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2026/02/23/LeetCode%201461.%E6%A3%80%E6%9F%A5%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2%E6%98%AF%E5%90%A6%E5%8C%85%E5%90%AB%E6%89%80%E6%9C%89%E9%95%BF%E5%BA%A6%E4%B8%BAK%E7%9A%84%E4%BA%8C%E8%BF%9B%E5%88%B6%E5%AD%90%E4%B8%B2/)哦~
+>
+> 千篇源码题解[已开源](https://github.com/LetMeFly666/LeetCode)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -1829,6 +1829,8 @@ categories: [自用]
 |praise|v. 赞扬<br/>n. 赞扬|
 |||
 |stipulation|n. 规定，约定，合同|
+|||
+|turnip|n. 萝卜|
 
 + 这个web要是能设计得可以闭眼(完全不睁眼)键盘控制背单词就好了。
 + 也许可以加个AI用最近词编故事功能(返回接口中支持标注所使用单词高亮?)

showRmScript.html

@@ -1,3 +1,5 @@
+# rm Codes\1461-check-if-a-string-contains-all-binary-codes-of-size-k_AC.cpp
+
 # 记录iphone快捷指令 自动化 当到达某位置时触发
 
 # move beautify.sh to github repo/gist