Palindrome Partitioning II

Given a string s, partition s such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

For example, given s = "aab",
Return 1 since the palindrome partitioning ["aa","b"] could be produced using 1 cut.

public class Solution {
    public int minCut(String s) {
        int len = s.length();
        int D[] = new int [len+1];
        for(int i=0;i<=len;i++){
            D[i] = len-i-1; //this means for example: abc cut 2
        }
        boolean [][]p = new boolean[len][len];
        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 ||p[i+1][j-1])){
                    D[i] = Math.min(D[i],D[j+1]+1);
                    p[i][j] = true;
                }
            }
        }
        return D[0];
    }
}