LeetCode 87. Scramble String

https://leetcode.com/problems/scramble-string/

Description

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

Code

class Solution:
    '''
    解题思路：
    对于字符串 s1 和 s2，设他们的长度为 L, 采用递归思想，如果
    1. s1 长度为 i 的前缀和 s2 长度为 i 的后缀构成 Scramble String；且s1 长为 (L-i) 的后缀 与 s2 长为 (L-i) 的前缀构成 Scramble String。(前缀后缀均非空)
    2. s1 长度为 i 的前缀和 s2 长度为 i 的前缀构成 Scramble String；且s1 长为 (L-i) 的后缀 与 s2 长为 (L-i) 的后缀构成 Scramble String。(前缀后缀均非空)
    满足以上两种情况之一的，则 s1, s2 构成 Scramble String。
    '''
    def isScramble(self, s1: 'str', s2: 'str') -> 'bool':
        len1 = len(s1)
        len2 = len(s2)
        
        if len1 != len2:
            return False

        if sorted(s1) != sorted(s2):
            return False
        
        # 长度小于3，一定成立
        if len1 <= 3 or s1 == s2:
            return True
        
        for i in range(1, len1):
            if (self.isScramble(s1[:i], s2[:i]) and self.isScramble(s1[i:], s2[i:])) or (self.isScramble(s1[:i], s2[-i:]) and self.isScramble(s1[i:], s2[:-i])):
                return True
            
        return False