Lintcode430 · Scramble String go

/**
430 · Scramble String
Algorithms
Hard
Accepted Rate
42%

DescriptionSolutionNotesDiscussLeaderboard
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.

You can start scrambling from any binary tree legally built from s1, but you can not rebuild another binary tree while you are scrambling to get s2.

Example
Example 1:

Input: s1 = “great”, s2 = “rgeat”
Output: true
Explanation: As described above.
Example 2:

Input: s1 = “a”, s2 = “b”
Output: false

https://blog.csdn.net/qq_46105170/article/details/108701661

https://www.lintcode.com/problem/430/
*/

/**
 * @param s1: A string
 * @param s2: Another string
 * @return: whether s2 is a scrambled string of s1
 */
func isScramble (s1 string, s2 string) bool {
	// write your code here
	if len(s1) != len(s2) {
		return false
	}
	var n = len(s1)
	var dp = make([][][]bool, n)
	for i := 0; i < n; i++ {
		dp[i] = make([][]bool, n)
		for j := 0; j < n; j++ {
			dp[i][j] = make([]bool, n + 1)
		}
	}
	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			for l := 1; l <= Min(i, j) + 1; l++ {
				if l == 1 {
					dp[i][j][l] = rune(s1[i]) == rune(s2[j])
					continue
				}
				for k := 1; k < l; k++ {
					if dp[i][j][k] && dp[i - k][j - k][l - k] {
						dp[i][j][l] = true
					}
					if dp[i][j - (l - k)][k] && dp[i - k][j][l - k] {
						dp[i][j][l] = true
					}
					// 发现能变换，直接退出循环
					if (dp[i][j][l]) {
						break;
					}
				}
			}
		}
	}
	return dp[n - 1][n - 1][n]
}

func Min(a, b int) int {
	if a < b {
		return a
	}
	return b
}