Problem Palindrome Partitioning II

Problem Description:

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.

Solution:

public int minCut(String s) {
        int[] res = new int[s.length()];
        boolean[][] mp = new boolean[s.length()][s.length()];

        for (int i = s.length() -1; i >= 0; i--) {
            for (int j = i; j < s.length(); j++) {
                if (s.charAt(i) == s.charAt(j) && ((j - i) < 2 || mp[i+1][j-1])) {
                    mp[i][j] = true;
                } else {
                    mp[i][j] = false;
                }
            }
        }

        for (int i = 0; i < s.length(); i++) {
            int ms = s.length();
            if (mp[0][i]) {
                res[i] = 0;
            } else {
                for (int j = 0; j < i; j++) {
                    if (mp[j+1][i] && ms > res[j] + 1) {
                        ms = res[j] + 1;
                    }
                }

                res[i] = ms;
            }
        }

        return res[s.length() -1];
    }