Palindrome Partitioning II

1. Title

Palindrome Partitioning II

2. Http address

https://leetcode.com/problems/palindrome-partitioning-ii/

3. The question

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.

Subscribe to see which companies asked this question

4. My code (AC)

    // Accepted
    public static int minCut(String s) {
        
        if ( s == null || s.length() <= 1)
            return 0;
        int len = s.length();
        boolean isPalindrome[][] = new boolean[len][len];
        int opt [] = new int[len];
        for(int i = 0 ; i < len; i++)
        {
            isPalindrome[i][i] = true;
        }
        
        for(int i = 0 ; i < len - 1; i++)
        {
            if ( s.charAt(i) == s.charAt(i+1)){
                isPalindrome[i][i+1] = true;
            }
        }
        
        for( int i = len - 3; i >=0 ; i--)
        {
            for( int j = i + 2; j < len; j++)
            {
                if( s.charAt(i) == s.charAt(j) && isPalindrome[i+1][j-1])
                {
                    isPalindrome[i][j] = true;
                }
            }
        }
        
        opt[len-1] = 0;
        for( int i = len -2; i >= 0 ; i--)
        {
            if ( isPalindrome[i][len-1] == true){
                System.out.println(i + " is " + true);
                opt[i] = 0;
                continue;
            }
            opt[i] = 1 + opt[i+1];
            System.out.println(i + ": "  + opt[i]);
            for( int k = i + 1; k < len - 1; k++)
            {
                if( isPalindrome[i][k])
                {
                    opt[i] = Math.min(opt[i], opt[k+1] + 1);
                }
            }
        }
        return opt[0];
    }