Leetcode 87. Scramble String

最新推荐文章于 2023-03-30 18:15:00 发布

朝气

最新推荐文章于 2023-03-30 18:15:00 发布

阅读量228

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/galaxy_wolf/article/details/51660945

版权

leetcode 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

问题

https://leetcode.com/problems/scramble-string/

解法1

递归
时间复杂度Ｏ(n^n)?

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if (s1.size() != s2.size())
            return false;
        if (s1.size() ==1)
            return s1==s2;
        int num[256]={0};
        for (int i=0; i<s1.size(); ++i)
        {
            ++num[s1[i]];
            --num[s2[i]];
        }
        for (int i=0; i< 256; ++i)
            if (num[i])
                return false;
        for (int i=1; i<s1.size(); ++i)
        {
            if (isScramble(s1.substr(0, i), s2.substr(0, i)) && isScramble(s1.substr(i), s2.substr(i)) ||
                isScramble(s1.substr(0, i), s2.substr(s1.size() -i)) && isScramble(s1.substr(i), s2.substr(0, s1.size()-i)))
                return true;
        }
        return false;
    }
};

解法二

dp 时间复杂度(n^4) 空间复杂度(n^3)

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if (s1.size() != s2.size())
            return false;
        int n = s1.size();
        if (n==0)
            return true;
        if (n==1)
            return s1 == s2;
        bool dp[n+1][n][n];
        memset(dp, 0, sizeof(dp));
        for (int x =0; x< n; ++x)
            for (int y=0; y<n; ++y)
                if (s1[x] == s2[y])
                    dp[1][x][y] = true;
        for (int len = 2; len <=n; ++len)
            for (int x=0; x+len <=n; ++x)
                for (int y =0; y+len<=n; ++y)
                    for (int len1=1; len1<len; ++len1)
                    {
                        int len2 = len -len1;
                        if (dp[len1][x][y] && dp[len2][x+len1][y+len1] || dp[len1][x][y+len2] && dp[len2][x+len1][y])
                            dp[len][x][y] = true;
                    }
        return dp[n][0][0];
    }
};