Leetcode 132: 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;
        if (len < 2) return 0;
        
        int[] cut = new int[len];
        bool[,] dp = new bool[len, len];
        
        for (int j = 0; j < len; j++)
        {
            for (int i = 0; i < len; i++)
            {
                if (i >= j || (s[i] == s[j] && dp[i + 1, j - 1]))
                {
                    dp[i, j] = true;
                }
            }
        }
        
        for (int j = 0; j < len; j++)
        {
            cut[j] = j;
            for (int i = 0; i <= j; i++)
            {
                if (dp[i, j])
                {
                    cut[j] = Math.Min(cut[j], i > 0 ? (cut[i - 1] + 1) : 0);
                }
            }
        }
        
        return cut[len - 1];
    }
}