132. Palindrome Partitioning II (java)

Author: bluesword12350

solution/0132.Palindrome Partitioning II/Solution.java

@@ -0,0 +1,21 @@
+class Solution {
+    public int minCut(String s) {
+        if(s==null || s.length()<=1)return 0;
+        int len = s.length();
+        int[] dp = new int[len];
+        for(int i=0;i<len;i++) dp[i] = len - 1;
+        for(int i=0;i<len;i++){
+            mincutHelper(s , i , i , dp);
+            mincutHelper(s, i , i+1 , dp);
+        }
+        return dp[len-1];
+    }
+    private void mincutHelper(String s, int i, int j, int[] dp){
+        int len = s.length();
+        while(i>=0 && j<len && s.charAt(i)==s.charAt(j)){
+            dp[j] = Math.min(dp[j] , (i==0?-1:dp[i-1])+1);
+            i--;
+            j++;
+        }
+    }
+}