796

796. Rotate String (Easy)

Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.

A shift on s consists of moving the leftmost character of s to the rightmost position.

• For example, if s = "abcde", then it will be "bcdea" after one shift.

 

Example 1:

Input: s = "abcde", goal = "cdeab"
Output: true

Example 2:

Input: s = "abcde", goal = "abced"
Output: false

 

Constraints:

• 1 <= s.length, goal.length <= 100
• s and goal consist of lowercase English letters.

Companies:
Zoom, Apple, Goldman Sachs, LinkedIn

Related Topics:
String, String Matching

Solution 1.

// OJ: https://leetcode.com/problems/rotate-string/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class Solution {
public:
    bool rotateString(string s, string goal) {
        return goal.size() == s.size() && (s + s).find(goal) != string::npos;
    }
};