1
class Solution {
2
  public boolean rotateString(String s, String goal) {
3
    int n = s.length(), m = goal.length();
4
    if (m != n) return false;
5

6
    for (int offset = 0; offset < n; offset++) {
7
      if (isMatch(s, goal, offset)) return true;
8
    }
9
    return false;
10
  }
11

12
  private boolean isMatch(String s, String g, int offset) {
13
    int n = s.length();
14
    for (int si = 0; si < n; si++) {
15
      int gi = (si + offset) % n;
16
      if (s.charAt(si) != g.charAt(gi)) return false;
17
    }
18
    return true;
19
  }
20
}