Interview question 01.09. string rotation

Subject requirements ：
String rotation . Given two strings s1 and s2, Please write code to check s2 Is it s1 It's spinning （ such as ,waterbottle yes erbottlewat Rotated string ）.

Topic understanding ：
The essence of rotation is to split a string into two substrings and then recombine them to see whether it satisfies the other string , Equivalent to double string .

 Example 1:

  Input ：s1 = "waterbottle", s2 = "erbottlewat"
  Output ：True
 Example 2:

  Input ：s1 = "aa", s2 = "aba"
  Output ：False

class Solution {
    
public:
    bool isFlipedString(string s1, string s2) {
    
    if(s1.size() != s2.size())
        return false;
    string s = s2 + s2;
    int a = s.find(s1);
    if(a!=-1)
        return true;
    else
        return false;
    }
};

Experience ：

string s1="zzabc";
s1.find("abc")
 If found, return the subscript , Return if not found -1