力扣剑指offer2第32天动态规划

94）最少回文分割

class Solution{
public:
    int minCut(string s){
        int n = s.size();
        vector<vector<int>> g(n, vector<int>(n, true));
        for(int i=n-1; i>=0; i--){
            for(int j=i+1; j<n; j++){
                g[i][j] = (s[i]==s[j]) && g[i+1][j-1];
            }
        }
        vector<int> f(n, INT_MAX);
        for(int i=0; i<n; i++){
            if(g[0][i]) f[i]=0;
            else{
                for(int j=0; j<i; j++){
                    if(g[j+1][i]) f[i]=min(f[i], f[j]+1);
                }
            }
        }
        return f[n-1];
    }
};

95)最长公共子序列

class Solution{
public:
    int longestCommonSubsequence(string text1, string text2){
        int m=text1.size(), n=text2.size();
        vector<vector<int>> dp(m+1, vector<int>(n+1));
        for(int i=1; i<=m; i++){
            char ch1 = text1[i-1];
            for(int j=1; j<=n; j++){
                char ch2 = text2[j-1];
                if(ch1 == ch2){
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                else{
                    dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                }
            }
        }
        return dp[m][n];
    }
};

96)字符串交织

class Solution {
public:
    bool isInterleave(string s1, string s2, string s3) {
      int m=s1.size(), n=s2.size(), t=s3.size();
      if(m+n!=t) return false;
      vector<vector<int>> dp(m+1, vector<int>(n+1));
      dp[0][0] = 1;
      for(int i=0; i<=m; i++){
        for(int j=0; j<=n; j++){
          int p=i+j-1;
          if(i>0) dp[i][j] = dp[i][j] || (dp[i-1][j] && s1[i-1]==s3[p]);
          if(j>0) dp[i][j] = dp[i][j] || (dp[i][j-1] && s2[j-1]==s3[p]);
        }
      }
      return dp[m][n];
    }
};