Maximum Score After Splitting a String LeetCode solution in C++

1
class Solution {
2
public:
3
int maxScore(string s) {
4
int ones = 0;
5
int res = -s.length();
6
for (int i = 0; i < s.length() - 1; i++) {
7
if (s[i] == '1') ones += 2;
8
if (i - ones > res) res = i - ones;
9
};
10

11
ones >>= 1;
12
if (s[s.length() - 1] == '1') ones++;
13

14
return ones + res + 1;
15
}
16
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0