LeetCode-87. Scramble String

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

ReignsDu

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

阅读量161

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.csdn.net/reigns_/article/details/88257358

LeetCode 专栏收录该内容

325 篇文章

订阅专栏

本文介绍了一种判断两个字符串是否可以通过乱序操作相互转换的算法。通过递归地将字符串分为两部分，检查子字符串是否可以乱序匹配，以及字符频率是否一致，来判断两个字符串是否属于乱序字符串。该算法适用于相同长度的字符串比较。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

题解：

当判断为false时，勿直接返回。（这里卡了我好久）

需要考虑左右子树匹配。

class Solution {
public:
  bool isSim(string a, string b) {
    sort (a.begin(), a.end());
    sort (b.begin(), b.end());
    return a == b;
  }
  bool isScramble(string s1, string s2) {
    int n = s1.length(), m = s2.length();
    if (n != m) {
      return false;
    }
    if (s1 == s2) {
      return true;
    }
    if (isSim(s1, s2) == false) {
      return false;
    }
    for (int i = 1; i < n; i++) {
      if (isScramble(s1.substr(0, i), s2.substr(0, i)) && isScramble(s1.substr(i, n - i), s2.substr(i, n - i))) {
        return true;
      }
      if (isScramble(s1.substr(0, i), s2.substr(n - i, i)) && isScramble(s1.substr(i, n - i), s2.substr(0, n - i))) {
        return true;
      }
    }
    return false;
  }
};