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.
Input: A = 'abcde', B = 'cdeab' Output: true
Input: A = 'abcde', B = 'abced' Output: false
- A and B will have length at most 100.
Credits To: leetcode.com
Leave me comments, if you have better ways to solve.
## Blog link: https://code.dennyzhang.com/rotate-string class Solution: def rotateString(self, A, B): """ :type A: str :type B: str :rtype: bool """ return len(A) == len(B) and B in A + A