LeetCode: Palindrome Partitioning II

dfs large没过，看了网上的dp

class Solution {
public:
    int minCut(string s) {
        int n = s.size();
        vector<int> C(n+1);
        vector<vector<bool> > P(n, vector<bool>(n));
        for (int i = 0; i < n; ++i) P[i][i] = true;
        for (int i = 0; i <= n; ++i) {
            C[i] = n - i;
        }
        for (int i = n-1; i >= 0; --i) {
            for (int j = i; j < n; ++j) {
                if (s[i] == s[j] && (j-i < 2 || P[i+1][j-1])) {
                    P[i][j] = true;
                    C[i] = min(C[i], 1+C[j+1]);
                }
            }
        }
        return C[0]-1;
    }
};

 C#

public class Solution {
    public int MinCut(string s) {
        int n = s.Length;
        int[] C = new int[n+1];
        bool[,] P = new bool[n, n];
        for (int i = 0; i < n; i++) P[i, i] = true;
        for (int i = 0; i <= n; i++) C[i] = n - i;
        for (int i = n-1; i >= 0; i--) {
            for (int j = i; j < n; j++) {
                if (s[i] == s[j] && (j-i < 2 || P[i+1, j-1])) {
                    P[i, j] = true;
                    C[i] = Math.Min(C[i], 1 + C[j+1]);
                }
            }
        }
        return C[0] - 1;
    }
}