leetcode

0 class Solution {

1 public:

2 long long minimumSteps(const string &s) const {

3 long long res = 0;

4

5 for (int i = 0, cnt = 0; i < size(s); i++) {

6 if (s[i] & 1)

7 cnt++;

8 else

9 res += cnt;

10 }

11

12 return res;

13 }

14 };