LintCode 1376: Equivalent Strings (经典递归题)

原题如下：
1376. Equivalent Strings
Given you two strings with same length, return true if they are equivalent.

Two strings a and b of equal length are called equivalent in one of the two cases:

They are equal.
If we split string a into two halves of the same size a1 and a2, and string b into two halves of the same size b1 and b2, then one of the following is correct:
a1 is equivalent to b1, and a2 is equivalent to b2
a1 is equivalent to b2, and a2 is equivalent to b1
Example
Example 1:

Input: s1 = “aaba”, s2 = “abaa”
Output: true
Example 2:

Input: s1 = “aabb”, s2 = “abab”
Output: false
Notice
Each of string has the length from 1 to 20000 and consists of lowercase English letters. The strings have the same length.

我用的递归。忘了这种解法是叫分治还是叫什么来着?
代码如下：

class Solution
 {
public:
    /**
     * @param s1: a string
     * @param s2: a string
     * @return: is s1 and s2 are equivalent
     */
    bool isEquivalentStrings(string &s1, string &s2) {
        
        if (s1.size() != s2.size()) 
            return false;
            
        if (s1 == s2)
            return true;
        
        int strSize=s1.size();
        
        if (strSize & 0x1)
            return false;
        
        string s1_1 = s1.substr(0, strSize/2);
        string s1_2 = s1.substr(strSize/2, strSize/2);
        string s2_1 = s2.substr(0, strSize/2);
        string s2_2 = s2.substr(strSize/2, strSize/2);
        //cout<<s1_1<<" "<<s1_2<<" "<<s2_1<<" "<<s2_2<<endl;
        
        return (isEquivalentStrings(s1_1, s2_1) && isEquivalentStrings(s1_2, s2_2)) ||
               (isEquivalentStrings(s1_1, s2_2) && isEquivalentStrings(s1_2, s2_1));
    }
    
    
};