[LeetCode] Scramble String

最新推荐文章于 2020-09-24 22:58:54 发布

lyangpku

最新推荐文章于 2020-09-24 22:58:54 发布

阅读量463

点赞数

分类专栏：算法 DP 面试题 LeetCode 文章标签： dp DP Leetcode leetcode LeetCode 算法面试题

本文链接：https://blog.csdn.net/lyangpku/article/details/8550929

版权

算法同时被 3 个专栏收录

110 篇文章 0 订阅

订阅专栏

面试题

110 篇文章 0 订阅

订阅专栏

LeetCode

110 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool isScramble(string s1, string s2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int n = s1.size();
        
        vector<vector<vector<bool> > > dp;
        
        for (int i = 0; i < n; i++) {
            vector<vector<bool> > matrix(n, vector<bool>(n + 1));
            dp.push_back(matrix);
        }
        
        for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (s1[i] == s2[j])
                dp[i][j][1] = true;
        
        for (int k = 2; k <= n; k++)
        for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        for (int p = 1; p < k; p++) {
            int q = k - p;
                        
            if (i + p >= n || j + p >= n || i + q >= n || j + q >= n)
                continue;
                        
            if (dp[i][j][p] && dp[i + p][j + p][q] || dp[i][j + q][p] && dp[i + p][j][q]) {
                dp[i][j][k] = true;
                break;
            }
        }
        
        return dp[0][0][n];
    }
};

Small Case: 8ms

Large Case: 800ms

Time: O(n^4)

Space: O(n^3)