Leetcode 132. Palindrome Partitioning II

public int minCut(String s) {

        

int min = 0;
int len = s.length() ;
boolean[][] matrix = new boolean[len][len];
int[] cuts = new int[len + 1];


if (s.length() == 0 || s == null) {
return min;
}
for (int i = 0; i <=len; i++) {
cuts[i] = len - i-1 ;
}
for (int i = len - 1; i >= 0; i--) {
for (int j = i; j < len; j++) {
if((s.charAt(i) == s.charAt(j) && j-i<2)
|| (s.charAt(i) == s.charAt(j) && matrix[i + 1][j - 1])) {
matrix[i][j] = true;
cuts[i] = Integer.min(cuts[i], cuts[j + 1] + 1);
}
}
}
min=cuts[0];


return min;

        
    }