test: 132 solution

c++

Author: QuBenhao

problems/problems_132/Solution.cpp

@@ -8,7 +8,25 @@ using json = nlohmann::json;
 class Solution {
 public:
     int minCut(string s) {
-        
+        int n = s.length();
+        vector<vector<bool>> is_palindrome(n, vector<bool>(n, false));
+        for (int i = 0; i < n; ++i) {
+            is_palindrome[i][i] = true;
+            for (int j = i - 1; j >= 0; --j) {
+                is_palindrome[j][i] = (s[i] == s[j]) && (i - j < 2 || is_palindrome[j + 1][i - 1]);
+            }
+        }
+
+        vector<int> cuts(n + 1, n);
+        cuts[0] = 0;
+        for (int i = 0; i < n; ++i) {
+            for (int j = 0; j <= i; ++j) {
+                if (is_palindrome[j][i]) {
+                    cuts[i + 1] = min(cuts[i + 1], cuts[j] + 1);
+                }
+            }
+        }
+        return cuts[n] - 1; // Subtract 1 because cuts[n] counts the number of partitions, not cuts
     }
 };
 

problems/problems_132/testcase

@@ -1,2 +1,2 @@
-["\"aab\"", "\"a\"", "\"ab\"", "\"abc\""]
-[1, 0, 1, 2]
+["\"aab\"", "\"a\"", "\"ab\"", "\"abc\"", "\"cabababcbc\""]
+[1, 0, 1, 2, 3]