leetcode 随笔 Scramble String

最新推荐文章于 2020-09-15 00:03:42 发布

原创最新推荐文章于 2020-09-15 00:03:42 发布 · 1.1w 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

note 专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种判断两个字符串是否可以通过乱序操作相互转换的方法。通过递归方式检查字符串能否通过节点交换得到另一个字符串，适用于相同长度的字符串比对。

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

这个题可以说是很难了，我也没什么思路，直接看的discuss。

discuss里主要分dp和递归两种思路，动态规划的办法这里就不赘述了，时间复杂度更高而且不容易理解。

如果想看可以参考这篇博客。

这里学习一下discuss里一篇优秀的递归代码

class Solution {
public:
    bool isScramble(string s1, string s2) {
        if(s1==s2)
            return true;
        
        int cnt[26] = {0};
        for(int i = 0;i<s1.size();++i){
            cnt[s1[i]-'a']++;
            cnt[s2[i]-'a']--;
        }
        for(auto num:cnt){
            if(num!=0)
                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)))
                return true;
            if(isScramble(s1.substr(0,i),s2.substr(s1.size()-i))&&
                    isScramble(s1.substr(i),s2.substr(0,s1.size()-i)))
                return true;
        }
        return false;
        
    }
};