feat: batch submit by kimi k2.5

Author: 0xMashiro

include/leetcode/problems/132-pattern.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_456 {
+
+using Func = std::function<bool(vector<int>&)>;
+
+class Pattern132Solution : public SolutionBase<Func> {
+ public:
+  //! 456. 132 Pattern
+  //! https://leetcode.com/problems/132-pattern/
+  bool find132pattern(vector<int>& nums);
+
+  Pattern132Solution();
+};
+
+}  // namespace problem_456
+}  // namespace leetcode

include/leetcode/problems/add-one-row-to-tree.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_623 {
+
+using Func = std::function<TreeNode*(TreeNode*, int, int)>;
+
+class AddOneRowToTreeSolution : public SolutionBase<Func> {
+ public:
+  //! 623. Add One Row to Tree
+  //! https://leetcode.com/problems/add-one-row-to-tree/
+  TreeNode* addOneRow(TreeNode* root, int val, int depth);
+
+  AddOneRowToTreeSolution();
+};
+
+}  // namespace problem_623
+}  // namespace leetcode

include/leetcode/problems/available-captures-for-rook.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_999 {
+
+using Func = std::function<int(vector<vector<char>>&)>;
+
+class AvailableCapturesForRookSolution : public SolutionBase<Func> {
+ public:
+  //! 999. Available Captures for Rook
+  //! https://leetcode.com/problems/available-captures-for-rook/
+  int numRookCaptures(vector<vector<char>>& board);
+
+  AvailableCapturesForRookSolution();
+};
+
+}  // namespace problem_999
+}  // namespace leetcode

include/leetcode/problems/best-time-to-buy-and-sell-stock-ii.h

@@ -0,0 +1,15 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_122 {
+
+using Func = std::function<int(vector<int>&)>;
+
+class BestTimeToBuyAndSellStockIiSolution : public SolutionBase<Func> {
+ public:
+  int maxProfit(vector<int>& prices);
+  BestTimeToBuyAndSellStockIiSolution();
+};
+
+}  // namespace problem_122
+}  // namespace leetcode

include/leetcode/problems/binary-watch.h

@@ -0,0 +1,18 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_401 {
+
+using Func = std::function<vector<string>(int)>;
+
+class BinaryWatchSolution : public SolutionBase<Func> {
+ public:
+  //! 401. Binary Watch
+  //! https://leetcode.com/problems/binary-watch/
+  vector<string> readBinaryWatch(int turnedOn);
+
+  BinaryWatchSolution();
+};
+
+}  // namespace problem_401
+}  // namespace leetcode

include/leetcode/problems/bitwise-ors-of-subarrays.h

@@ -0,0 +1,18 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_898 {
+
+using Func = std::function<int(vector<int>&)>;
+
+class BitwiseOrsOfSubarraysSolution : public SolutionBase<Func> {
+ public:
+  //! 898. Bitwise ORs of Subarrays
+  //! https://leetcode.com/problems/bitwise-ors-of-subarrays/
+  int subarrayBitwiseORs(vector<int>& arr);
+
+  BitwiseOrsOfSubarraysSolution();
+};
+
+}  // namespace problem_898
+}  // namespace leetcode

include/leetcode/problems/build-a-matrix-with-conditions.h

@@ -0,0 +1,19 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_2392 {
+
+using Func = std::function<vector<vector<int>>(int, vector<vector<int>>&, vector<vector<int>>&)>;
+
+class BuildAMatrixWithConditionsSolution : public SolutionBase<Func> {
+ public:
+  //! 2392. Build a Matrix With Conditions
+  //! https://leetcode.com/problems/build-a-matrix-with-conditions/
+  vector<vector<int>> buildMatrix(int k, vector<vector<int>>& rowConditions, 
+                                   vector<vector<int>>& colConditions);
+
+  BuildAMatrixWithConditionsSolution();
+};
+
+}  // namespace problem_2392
+}  // namespace leetcode

include/leetcode/problems/build-array-from-permutation.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_1920 {
+
+using Func = std::function<vector<int>(vector<int>&)>;
+
+class BuildArrayFromPermutationSolution : public SolutionBase<Func> {
+ public:
+  //! 1920. Build Array from Permutation
+  //! https://leetcode.com/problems/build-array-from-permutation/
+  vector<int> buildArray(vector<int>& nums);
+
+  BuildArrayFromPermutationSolution();
+};
+
+}  // namespace problem_1920
+}  // namespace leetcode

include/leetcode/problems/camelcase-matching.h

@@ -0,0 +1,23 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_1023 {
+
+using Func = std::function<vector<bool>(vector<string>&, string)>;
+
+/**
+ * 1023. Camelcase Matching
+ * https://leetcode.com/problems/camelcase-matching/
+ * 
+ * 判断 queries 中的每个字符串是否匹配 pattern
+ * 匹配规则：可以在 pattern 中插入小写字母得到 query
+ */
+class CamelcaseMatchingSolution : public SolutionBase<Func> {
+ public:
+  vector<bool> camelMatch(vector<string>& queries, string pattern);
+
+  CamelcaseMatchingSolution();
+};
+
+}  // namespace problem_1023
+}  // namespace leetcode

include/leetcode/problems/can-i-win.h

@@ -0,0 +1,18 @@
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_464 {
+
+using Func = std::function<bool(int, int)>;
+
+class CanIWinSolution : public SolutionBase<Func> {
+ public:
+  //! 464. Can I Win
+  //! https://leetcode.com/problems/can-i-win/
+  bool canIWin(int maxChoosableInteger, int desiredTotal);
+
+  CanIWinSolution();
+};
+
+}  // namespace problem_464
+}  // namespace leetcode