题解 | 翻转子串

#include <vector>
class ReverseEqual {
public:
    bool checkReverseEqual(string s1, string s2) {

        // write code here
        if (s1.length() != s2.length())
        return false;
        int len = s1.length();
        std::vector<int> step;
        for(int i=0;i<len;i++)
        {
           if(s1[0] == s2[i])
           step.emplace_back(i);          
        }
        for(int s: step){
            bool flag = true;
            for(int i=1;i<len;i++){
                if(s1[i] != s2[(i+s)%len ] ){
                    flag = false;
                    break;
                }
                
            }
            if (flag) return true;
        }
        return false;
    }
};