LeetCode 664

状态： f [ l ] [ r ] f[l][r] f[l][r]打印区间的花费，

最基本的区间DP分治， f [ l ] [ r ] = m i n { f [ l ] [ k ] , f [ k + 1 ] [ r ] } f[l][r] = min\{f[l][k],f[k+1][r] \} f[l][r]=min{f[l][k],f[k+1][r]}

动态转移方程， f [ l ] [ r ] = f [ l ] [ r − 1 ] f[l][r] = f[l][r-1] f[l][r]=f[l][r−1] 如果 s [ l ] = = s [ r ] s[l]==s[r] s[l]==s[r],（ f [ l + 1 ] [ r ] f[l+1][r] f[l+1][r]）也是一样的。

class Solution {

public:

int strangePrinter(string s) {

int n = s.size();

vector<vector > f(n,vector(n));

for(int i = n - 1; i >= 0; i–) {

f[i][i] = 1;

for(int j = i + 1; j < n; j++) {

if(s[i] == s[j]) {

f[i][j] = f[i][j-1];

}else {

int mmin = 1e9;

for(int k = i + 1; k <= j; k++) {

mmin = min(mmin,f[i][k-1] + f[k][j]);

}