Rotate String

Description:

We are given two strings, A and B.

A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = 'abcde', then it will be 'bcdea' after one shift on A. Return True if and only if A can become B after some number of shifts on A.

Example 1:
Input: A = 'abcde', B = 'cdeab'
Output: true

Example 2:
Input: A = 'abcde', B = 'abced'
Output: false

思路1：循环将A的第一个字符放到A的最后，比较A和B是否相同

class Solution {
public:
    bool rotateString(string A, string B) {
        if(A.length() == 0 && B.length() == 0)
            return true;
        
        for(int i = 0; i < A.length(); i++)
        {
            if(A.compare(B) == 0)
                return true;
             A = A.substr(1) + A.substr(0, 1);
        }
        return false;
        
    }
};

思路2：思路1的时间复杂度为O(n)，看到了一个更巧妙的方法，将字符串A放到A后面形成 字符串A+A，在字符串A+A中查找是否存在B

class Solution {
public:
    bool rotateString(string A, string B) {
        return ((A.length() == B.length()) && (A + A).find(B) != -1);
        
    }
};