Eric 的小站

1
class Solution {
2
public:
3
    int maxOperations(string s) {
4
        int result = 0;
5
        int count = 0;
6
        for (int i = 0; i < s.length();i++) {
7
            if (s[i] == '1') {
8
                count++;
9
            } else if (i && s[i-1] == '1') {
10
                result+=count;
11
            }
12
        }
13
        return result;
14
    }
15
};