leetcode-87 Scramble String-CSDN博客

本文链接：https://blog.csdn.net/qq_38340127/article/details/90295386

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 any non-leaf node and swap its two children.

For example, if we choose the node "gr" and swap its two children, it produces a scrambled string "rgeat".

    rgeat
   /    \
  rg    eat
 / \    /  \
r   g  e   at
           / \
          a   t

We say that "rgeat" is a scrambled string of "great".

Similarly, if we continue to swap the children of nodes "eat" and "at", it produces a scrambled string "rgtae".

    rgtae
   /    \
  rg    tae
 / \    /  \
r   g  ta  e
       / \
      t   a

We say that "rgtae" is a scrambled string of "great".

Given two strings s1 and s2 of the same length, determine if s2 is a scrambled string of s1.

Example 1:

Input: s1 = "great", s2 = "rgeat"
Output: true

Example 2:

Input: s1 = "abcde", s2 = "caebd"
Output: false

按照题意将字符串分为两个非空子集，然后进行判断能否通过交换进行获得相同的结果，第一反应是递归实现如下： public boolean isScramble(String s1, String s2) {
if(s1==s2) {
   return true;
}else if(s1==null || s2==null) {
   return false;
}else if(s1.equals(s2)) {
   return true;
} else if(s2.isEmpty() || s1.isEmpty()) {
   return false;
}else if(s1.length() != s2.length()) {
   return false;
}
int length = s1.length();
if(length ==1 ) {
   return s1.equals(s2);
}else if(length == 2) {
   return s1.equals(s2) || (s1.charAt(0)==s2.charAt(1) && s1.charAt(1)==s2.charAt(0));
}
//用i将s1分为s[0:i]和s[i:s1.length()]
   for(int i=1;i<=s1.length()-1;i++) {
       boolean tmp = (isScramble(s1.substring(0, i),s2.substring(0, i))
           &&   isScramble(s1.substring(i, length),s2.substring(i, length)))
           || (isScramble(s1.substring(0, i),s2.substring(length-i, length))
               &&   isScramble(s1.substring(i, length),s2.substring(0, length-i)));

       if(tmp) {
           return true;
       }
   }
   return false;
}

然后方法超时了。。。那么有哪里可以优化的？在两个字符串进行比较的时候如果包含的字符都不相同，那么直接return false 便可，节约了一堆递归的时间最终如下：

public boolean isScramble(String s1, String s2) {
if(s1==s2) {
   return true;
}else if(s1==null || s2==null) {
   return false;
}else if(s1.equals(s2)) {
   return true;
} else if(s2.isEmpty() || s1.isEmpty()) {
   return false;
}else if(s1.length() != s2.length()) {
   return false;
}
int length = s1.length();
if(length ==1 ) {
   return s1.equals(s2);
}else if(length == 2) {
   return s1.equals(s2) || (s1.charAt(0)==s2.charAt(1) && s1.charAt(1)==s2.charAt(0));
}
Map<Character,Integer> sMap = new HashMap<>();
for(int index=0;index<s1.length();index++) {
   sMap.put(s1.charAt(index), sMap.getOrDefault(s1.charAt(index),0)+1);
}
for(int index=0;index<s2.length();index++) {
   int number = 0;
   if(sMap.get(s2.charAt(index))==null || (number=sMap.get(s2.charAt(index)))==0) {
       return false;
   }
   sMap.put(s2.charAt(index), number-1);
}


boolean res=false;
//用i将s1分为s[0:i]和s[i:s1.length()]
   for(int i=1;i<=s1.length()-1;i++) {
       res = (isScramble(s1.substring(0, i),s2.substring(0, i))
           &&   isScramble(s1.substring(i, length),s2.substring(i, length)))
           || (isScramble(s1.substring(0, i),s2.substring(length-i, length))
               &&   isScramble(s1.substring(i, length),s2.substring(0, length-i)));
       if(res) {
           return true;
       }
   }
   return res;
}