leetcode

0 class Solution {

1 public:

2 int maxOperations(const string &s) const {

3 const int n = size(s);

4 int res = 0, count = 0;

5

6 for (int i = 0; i < n;) {

7 const int start = i;

8

9 while (i < n && s[i] == s[start])

10 i++;

11

12 if (s[start] == '0')

13 res += count;

14 else

15 count += i - start;

16 }

17 return res;

18 }

19 };