87. 扰乱字符串

题目描述

点这里

思路分析

递归/dp
递归会TLE，这里用dp

代码实现

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if (s1.size() != s2.size()) return false;
        int n = s1.size();
        vector<vector<vector<bool>>> dp(n, vector<vector<bool>>(n, vector<bool>(n + 1)));
        for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) dp[i][j][1] = s1[i] == s2[j];
        for (int k = 2; k <= n; k++) {
            for (int i1 = 0; i1 <= n - k; i1++) {
                for (int i2 = 0; i2 <= n - k; i2++) {
                    for (int i = 1; i < k; i++) {
                        if ((dp[i1][i2][i] && dp[i1 + i][i2 + i][k - i])
                        || (dp[i1][i2 + k - i][i] && dp[i1 + i][i2][k - i]))
                            dp[i1][i2][k] = true;
                    }
                }
            }
        }

        return dp[0][0][n];
    }

};