Minimum Moves to Convert String LeetCode solution in Java

1
class Solution {
2
  public int minimumMoves(String s) {
3
    int i = 0;
4
    int step = 0;
5
    while (i < s.length()) {
6
      if (s.charAt(i) == 'X') {
7
        i = i + 3;
8
        step++;
9
      } else {
10
        i++;
11
      }
12
    }
13
    return step;
14
  }
15
}