Skip to content

Latest commit

 

History

History
23 lines (15 loc) · 530 Bytes

README.md

File metadata and controls

23 lines (15 loc) · 530 Bytes

161.Rotate String

Description

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.

Examples

Example 1:
Input: A = 'abcde', B = 'cdeab'
Output: true

Example 2:
Input: A = 'abcde', B = 'abced'
Output: false

From

LeetCode