Weekly Contest 75题解
Q1. Rotate String(796)
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
andB
will have length at most100
.
1 class Solution { 2 public: 3 bool rotateString(string A, string B) { 4 if(A.size() != B.size()) 5 return false; 6 7 for( int i = 0; i < A.size(); i++) 8 bool ok = true; 9 for(int j = 0; j < B.size(); j++) 10 if(A[(i + j) % A.size()] != B[j]) { 11 ok = false; 12 break; 13 } 14 if(ok) { 15 return true; 16 } 17 return false; 18 } 19 };