Leetcode 796: 旋转字符串

#include<iostream>

using namespace std;

class Solution {
public:
    bool equateString(string s, string goal, int pos){
        int j=pos;
        for(int i=0;i<s.length();i++){
            if(s[i]!=goal[j]){
                return false;
            }
            j++;
            if(j>=goal.length()){
                j=0;
            }
        }
        return true;
    }

    bool rotateString(string s, string goal) {
        if(s.length()!=goal.length()){
            return false;
        }
        for(int i=0;i<goal.length();i++){
            bool result = equateString(s,goal,i);
            if(result){
                return true;
            }
        }
        return false;
    }
};

int main(void){
    Solution s;
    string a("abcde");
    string b("cdeab");
    cout<<s.rotateString(a,b)<<endl;;
    return 0;
}