Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0701_0800.s0796_rotate_string.Solution

```
public class Solution
extends Object
```
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.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean rotateString(String s, String goal)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

rotateString

public boolean rotateString(String s,
                            String goal)