[Leetcode]Palindrome Partitioning II

class Solution {
public:
int minCut(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<int> f(s.size()+1, 0);
vector<vector<bool>> p(s.size(), vector<bool>(s.size(), false));
for(int i = s.size() - 1; i >= 0; i--)
for(int j = i; j < s.size(); ++j)
{
if(s[i] == s[j] && (j-i < 2 || p[i+1][j-1]))
p[i][j] = true;
}
for(int i = 1; i <= s.size(); ++i)
{
f[i] = INT_MAX;
for(int j = 0; j < i; ++j)
if(p[j][i-1])
f[i] = min(f[i], f[j] + 1);
}
return f[s.size()] - 1;
}
};