87. Scramble String

LeetCode
Explore
Problems
Mock 
Contest
Articles
Discuss
 Store 
 Premium
New Playground
lifeqiuzhi520
 180 297

87. Scramble String
DescriptionHintsSubmissionsDiscussSolution
You have no submission yet.
Java	





i
1
class Solution {
2
    public boolean isScramble(String s1, String s2) {
3
        if(s1.equals(s2)){
4
            return true;
5
        }
6
        int index[] = new int[26];
7
        for(int i = 0; i < s1.length();i++){
8
            index[s1.charAt(i)-'a']++;
9
            index[s2.charAt(i)-'a']--;
10
        }
11
        for(int i = 0;i < index.length;i++){
12
            if(index[i]!=0){
13
                return false;
14
            }
15
        }
16
        for(int i = 1;i < s1.length();i++){
17
            if(isScramble(s1.substring(0,i),s2.substring(0,i))&&isScramble(s1.substring(i),s2.substring(i))){
18
                return true;
19
            }
20
            if(isScramble(s1.substring(0,i),s2.substring(s2.length()-i))&&isScramble(s1.substring(i),s2.substring(0,s2.length()-i))){
21
                return true;
22
            }
23
        }
24
        return false;
25
    }
26
}
  Custom Testcase( Contribute  )
 Run Code Submit Solution
Submission Result: Accepted More Details 
Next challenges: Mini ParserArithmetic SlicesConstruct String from Binary Tree
Share your acceptance!
Notes
|||

Type here...(Markdown is enabled)
​
Copyright © 2018 LeetCode Contact Us  |  Jobs  |  Students  |  Frequently Asked Questions  |  Terms of Service  |  Privacy Policy