LeetCode #87: Scramble String

Problem Statement

(Source) 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.

---

Tags: Dynamic Programming, String.

Analysis

Recursion with Memorisation.

Solution

class Solution(object):
    def isScramble(self, s1, s2):
        """Rucursion.
        :type s1: str
        :type s2: str
        :rtype: bool
        """
        def helper(memo, s1, s2):
            if s1 == s2:
                return True

            if len(s1) != len(s2):
                return False

            if sorted(s1) != sorted(s2):
                return False

            if (s1, s2) in memo:
                return memo[s1, s2]
            else:
                memo[s1, s2] = False
            n = len(s1)
            for i in xrange(1, n):
                memo[s1, s2] = (helper(memo, s1[:i], s2[:i]) and helper(memo, s1[i:], s2[i:])) or (helper(memo, s1[:i], s2[-i:]) and helper(memo, s1[i:], s2[:-i]))
                if memo[s1, s2]:
                    return True
            return False


        if (not s1 and s2) or (s1 and not s2):
            return False
        if not s1 and not s2:
            return True
        memo = {}
        return helper(memo, s1, s2)