1.先求出s[m,n]之间是否是回文串,如果是则设置s[n][m] = 1,反之为0;
2.用dp求出前n个字符的最小回文子串个数
class Solution {
public int minCut(String s) {
if(s == null){
return -1;
}
int len = s.length();
if(len == 0){
return -1;
}
if(len == 1){
return 0;
}
int[] dp = new int[len];
int[][] a = new int[len][len];
int m = 0;
int n = 0;
for(int t = 0;t < len;++t){
m = n = t;
while(m >= 0 && n < len && s.charAt(m) == s.charAt(n)){
a[n][m] = 1;
--m;
++n;
}
m = t;
n = t + 1;
while(m >= 0 && n < len && s.charAt(m) == s.charAt(n)){
a[n][m] = 1;
--m;
++n;
}
}
dp[0] = 1;
for(int i = 1;i < len;++i){
dp[i] = dp[i - 1] + 1;
for(int j = 0;j < i;++j){
if(a[i][j] == 1){
if(j == 0){
dp[i] = Math.min(1,dp[i]);
}else{
dp[i] = Math.min(dp[j - 1] + 1,dp[i]);
}
}
}
}
return dp[len - 1] - 1;
}
}