796. Rotate String

📋 Đề Bài

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.

🧠 Thuật Toán & Kỹ Thuật

Union Find (Tập hợp rời rạc)String (Chuỗi)

⏱️ Thời gian O(n)

💾 Không gian O(1)

💻 Lời Giải

C++ 0796-rotate-string.cpp

class Solution {
public:
    bool rotateString(string s, string goal) {
        return s.size() == goal.size() && (s + s).find(goal) != string::npos;
    }
};