[LeetCode] 094: Scramble String

[Problem]

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.

[Solution]

class Solution {
public:
	/**
	 * if s1 and s2 are anagrams
	 */
	bool isAnagram(string s1, string s2){
		if(s1.size() != s2.size())return false;
		if(s1 == s2)return true;

		// check
		map<char, int> myMap;

		// letter count of s1
		for(int i = 0; i < s1.size(); ++i){
			if(myMap.find(s1[i]) == myMap.end()){
				myMap[s1[i]] = 1;
			}
			else{
				myMap[s1[i]] += 1;
			}
		}

		// letter count of s2
		for(int i = 0; i < s2.size(); ++i){
			if(myMap.find(s2[i]) == myMap.end()){
				return false;
			}
			else if(myMap[s2[i]] <= 0)return false;
			myMap[s2[i]] -= 1;
		}
		return true;
	}
	/**
	 * if s2 is a scramble string of s1
	 */
	bool isScramble(string s1, string s2) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		
		// same string
		if(s1 == s2)return true;

		// not anagrams
		if(!isAnagram(s1, s2))return false;

		// partition
		for(int len = 1; len < s1.size(); ++len){
			// partition s1 and s2 into two parts respectively
			string s1_head1 = s1.substr(0, len);
			string s1_tail1 = s1.substr(len, s1.size()-len);
			string s2_head1 = s2.substr(0, len);
			string s2_tail1 = s2.substr(len, s2.size()-len);
			if(isScramble(s1_head1, s2_head1) && isScramble(s1_tail1, s2_tail1))return true;

			string s2_head2 = s2.substr(0, s2.size()-len);
			string s2_tail2 = s2.substr(s2.size()-len, len);
			if(isScramble(s1_head1, s2_tail2) && isScramble(s1_tail1, s2_head2))return true;
		}
		return false;
	}
};

说明：版权所有，转载请注明出处。 Coder007的博客