87. Scramble String

class Solution {
    public boolean isScramble(String s1, String s2) {
        if(s1.length()==0||s1.equals(s2))
            return true;
        int[] cnt=new int[128];
        for(int i=0;i<s1.length();i++)
        {
            cnt[s1.charAt(i)]++;
            cnt[s2.charAt(i)]--;
        }
        for(int i=0;i<128;i++)
            if(cnt[i]!=0)
                return false;
        for(int i=1;i<s1.length();i++)
        {
            if(isScramble(s1.substring(0,i), s2.substring(0,i))&&isScramble(s1.substring(i),s2.substring(i)))
                return true;
            if(isScramble(s1.substring(0,i), s2.substring(s1.length()-i))&&isScramble(s1.substring(i), s2.substring(0, s1.length()-i)))
                return true;
        }
        return false;
    }
}

时间： 2024-11-05 15:57:23

87. Scramble String的相关文章

87. Scramble String（js）

87. Scramble String Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / gr eat / \ / g r e at / a t To scramble the str

【一天一道LeetCode】#87. Scramble String

一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博欢迎转载,转载请注明出处 (一)题目 Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s

[LeetCode] 87. Scramble String Java

题目: Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / gr eat / \ / g r e at / a t To scramble the string, we may choo

(动态规划、递归) leetcode 87. Scramble String

思路:用递归来做感觉比动态规划简单,题目让我们判断s1和s2是否是scramble string,则s1上(从左起计数)有一个长度为 i 的分割点将s1分为s1_l 和 s1_r 两段分别与 s2的(从左起计数一个长度为i的) s2_l 和 s2_r 互为 scramble string:或者与 s2的(从右起计数一个长度为i的)s2.substr(s-i) 和 s2.substr(0, s-i) 互为 scramble string . 1)C++ 中的 substr(pos, len) 表

Leetcode 87 Scramble String

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / gr eat / \ / g r e at / a t To scramble the string, we may choose a

87. Scramble String