[LeetCode] Problem 796 - Rotate String

Posted on | In ,

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

No.1

Input: A = ‘abcde’, B = ‘cdeab’

Output: true

No.2

Input: A = ‘abcde’, B = ‘abced’

Output: false

Note

  • A and B will have length at most 100.

Code

1
2
3
4
5
6
public boolean rotateString(String A, String B) {
    if (A.length() != B.length())
        return false;

    return (A + A).indexOf(B) >= 0;
}