leetcode

0 class Solution {

1 public:

2 int minChanges(const string &s) const {

3 int res = 0;

4 for (int i = 1; i < s.size(); i += 2) {

5 res += s[i] != s[i - 1];

6 }

7 return res;

8 }

9 };