[Leetcode] 796. Rotate String 解题报告

题目：

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

Note:

A

 and 

B

 will
have length at most 

100

.
思路：

练手题目，哈哈。

代码：

class Solution {
public:
bool rotateString(string A, string B) {
if (A.length() != B.length()) {
return false;
}
if (A == B) {
return true;
}
for (int i = 0; i + 1 < A.length(); ++i) {
A.push_back(A[0]); // move the first char to the back
A.erase(A.begin());
if (A == B) {
return true;
}
}
return false;
}
};