Minimum Moves to Convert String LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minimumMoves(string s) {
4
    int count = 0;
5
    int i = 0;
6

7
    for (int i = 0; i < s.size();) {
8
      if (s[i] == 'O') {
9
        // continue;
10
        i++;
11
      } else {
12
        count++;
13
        i += 3;
14
      }
15
    }
16
    return count;
17
  }
18
};