feat: Add solution for LeetCode #1461

Author: 0xMashiro

SOLVED.md

@@ -161,6 +161,7 @@
 | 1419 | [Minimum Number of Frogs Croaking](https://leetcode.com/problems/minimum-number-of-frogs-croaking/) | [Code](src/leetcode/problems/minimum-number-of-frogs-croaking.cpp) / [Test](test/leetcode/problems/minimum-number-of-frogs-croaking.cpp) |
 | 1446 | [Consecutive Characters](https://leetcode.com/problems/consecutive-characters/) | [Code](src/leetcode/problems/consecutive-characters.cpp) / [Test](test/leetcode/problems/consecutive-characters.cpp) |
 | 1458 | [Max Dot Product of Two Subsequences](https://leetcode.com/problems/max-dot-product-of-two-subsequences/) | [Code](src/leetcode/problems/max-dot-product-of-two-subsequences.cpp) / [Test](test/leetcode/problems/max-dot-product-of-two-subsequences.cpp) |
+| 1461 | [Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) | [Code](src/leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.cpp) / [Test](test/leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.cpp) |
 | 1499 | [Max Value of Equation](https://leetcode.com/problems/max-value-of-equation/) | [Code](src/leetcode/problems/max-value-of-equation.cpp) / [Test](test/leetcode/problems/max-value-of-equation.cpp) |
 | 1510 | [Stone Game IV](https://leetcode.com/problems/stone-game-iv/) | [Code](src/leetcode/problems/stone-game-iv.cpp) / [Test](test/leetcode/problems/stone-game-iv.cpp) |
 | 1514 | [Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/) | [Code](src/leetcode/problems/path-with-maximum-probability.cpp) / [Test](test/leetcode/problems/path-with-maximum-probability.cpp) |

include/leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_1461 {
+
+using Func = std::function<bool(string, int)>;
+
+class CheckIfAStringContainsAllBinaryCodesOfSizeKSolution : public SolutionBase<Func> {
+ public:
+  //! 1461. Check If a String Contains All Binary Codes of Size K
+  //! https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/
+  bool hasAllCodes(string s, int k);
+
+  CheckIfAStringContainsAllBinaryCodesOfSizeKSolution();
+};
+
+}  // namespace problem_1461
+}  // namespace leetcode

src/leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.cpp

@@ -0,0 +1,93 @@
+
+#include "leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.h"
+
+namespace leetcode {
+namespace problem_1461 {
+
+// 滑动窗口 + 位运算 + 哈希集合
+// 时间复杂度: O(n), 空间复杂度: O(2^k)
+static bool solution1(string s, int k) {
+  const int n = s.size();
+  const int total = 1 << k;  // 2^k
+  
+  // 剪枝：字符串长度不足以包含所有子串
+  if (n < k + total - 1) {
+    return false;
+  }
+  
+  unordered_set<int> seen;
+  int mask = total - 1;  // k 个 1，用于取低 k 位
+  int num = 0;
+  
+  // 初始化窗口
+  for (int i = 0; i < k; ++i) {
+    num = (num << 1) | (s[i] - '0');
+  }
+  seen.insert(num);
+  
+  // 滑动窗口
+  for (int i = k; i < n; ++i) {
+    // 去掉最高位，加入新位
+    num = ((num << 1) & mask) | (s[i] - '0');
+    seen.insert(num);
+    // 提前退出：如果已经找到所有子串
+    if (seen.size() == total) {
+      return true;
+    }
+  }
+  
+  return seen.size() == total;
+}
+
+// 使用 vector<bool> 替代 unordered_set，空间更优
+// 时间复杂度: O(n), 空间复杂度: O(2^k)
+static bool solution2(string s, int k) {
+  const int n = s.size();
+  const int total = 1 << k;  // 2^k
+  
+  // 剪枝
+  if (n < k + total - 1) {
+    return false;
+  }
+  
+  vector<bool> seen(total, false);
+  int count = 0;
+  int mask = total - 1;
+  int num = 0;
+  
+  // 初始化窗口
+  for (int i = 0; i < k; ++i) {
+    num = (num << 1) | (s[i] - '0');
+  }
+  seen[num] = true;
+  count = 1;
+  
+  // 滑动窗口
+  for (int i = k; i < n; ++i) {
+    num = ((num << 1) & mask) | (s[i] - '0');
+    if (!seen[num]) {
+      seen[num] = true;
+      ++count;
+      if (count == total) {
+        return true;
+      }
+    }
+  }
+  
+  return count == total;
+}
+
+CheckIfAStringContainsAllBinaryCodesOfSizeKSolution::CheckIfAStringContainsAllBinaryCodesOfSizeKSolution() {
+  setMetaInfo({.id = 1461,
+               .title = "Check If a String Contains All Binary Codes of Size K",
+               .url = "https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/"});
+  registerStrategy("Sliding Window + HashSet", solution1);
+  registerStrategy("Sliding Window + Vector", solution2);
+}
+
+bool CheckIfAStringContainsAllBinaryCodesOfSizeKSolution::hasAllCodes(string s, int k) {
+  return getSolution()(s, k);
+}
+
+}  // namespace problem_1461
+}  // namespace leetcode

test/leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.cpp

@@ -0,0 +1,39 @@
+
+#include "leetcode/problems/check-if-a-string-contains-all-binary-codes-of-size-k.h"
+
+#include "gtest/gtest.h"
+
+namespace leetcode {
+namespace problem_1461 {
+
+class CheckIfAStringContainsAllBinaryCodesOfSizeKTest : public ::testing::TestWithParam<string> {
+ protected:
+  void SetUp() override { solution.setStrategy(GetParam()); }
+
+  CheckIfAStringContainsAllBinaryCodesOfSizeKSolution solution;
+};
+
+TEST_P(CheckIfAStringContainsAllBinaryCodesOfSizeKTest, Example1) {
+  string s = "00110110";
+  int k = 2;
+  EXPECT_TRUE(solution.hasAllCodes(s, k));
+}
+
+TEST_P(CheckIfAStringContainsAllBinaryCodesOfSizeKTest, Example2) {
+  string s = "0110";
+  int k = 1;
+  EXPECT_TRUE(solution.hasAllCodes(s, k));
+}
+
+TEST_P(CheckIfAStringContainsAllBinaryCodesOfSizeKTest, Example3) {
+  string s = "0110";
+  int k = 2;
+  EXPECT_FALSE(solution.hasAllCodes(s, k));
+}
+
+INSTANTIATE_TEST_SUITE_P(
+    LeetCode, CheckIfAStringContainsAllBinaryCodesOfSizeKTest,
+    ::testing::ValuesIn(CheckIfAStringContainsAllBinaryCodesOfSizeKSolution().getStrategyNames()));
+
+}  // namespace problem_1461
+}  // namespace leetcode