leetcode

0 class Solution {

1 public:

2 int minOperations(const string &s) const {

3 int num = 0, crnt = 1;

4 for (const char c : s) {

5 if ((c & 0xF) != crnt) num++;

6 crnt = !crnt;

7 }

8 return min(num, (int)size(s) - num);

9 }

10 };