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
class Solution {
public:
bool rotateString(string A, string B) {
int len_A = A.length();
int len_B = B.length();
if(len_A == 0 && len_B == 0) return true;
for(int i = 0; i < len_A; i++){
string tmp = A.substr(i + 1, len_A - i - 1) + A.substr(0, i + 1);
if(tmp == B) return true;
}
return false;
}
};