Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring).
The score after splitting a string is the number of zeros in the left substring plus the number of ones in the right substring.
Example 1:
Input: s = "011101" Output: 5 Explanation: All possible ways of splitting s into two non-empty substrings are: left = "0" and right = "11101", score = 1 + 4 = 5 left = "01" and right = "1101", score = 1 + 3 = 4 left = "011" and right = "101", score = 1 + 2 = 3 left = "0111" and right = "01", score = 1 + 1 = 2 left = "01110" and right = "1", score = 2 + 1 = 3
Example 2:
Input: s = "00111" Output: 5 Explanation: When left = "00" and right = "111", we get the maximum score = 2 + 3 = 5
Example 3:
Input: s = "1111" Output: 3
Constraints:
2 <= s.length <= 500s consists of characters '0' and '1' only.class Solution {
public int maxScore(String s) {
int n = s.length(), nZeros = 0, nOnes = 0, maxScore = -n;
for (int i = 0; i < n - 1; i++) {
if (s.charAt(i) == '0')
nZeros++;
else
nOnes++;
// At posn. i, score = nZeros + totalOnes(Unknown) - nOnes
maxScore = Math.max(maxScore, nZeros - nOnes);
}
nOnes += s.charAt(n - 1) - '0';
return maxScore + nOnes; // As now, totalOnes is known.
}
}class Solution {
public int maxScore(String s) {
char[] cs = s.toCharArray();
int z = 0, n = cs.length, maxScore = 0, ltScore = 0;
for (char c : cs)
if (c == '0')
z++;
for (int i = 0; i < n - 1; i++) {
if (cs[i] == '0')
ltScore++;
maxScore = Math.max(maxScore, 2 * ltScore + n - 1 - i - z);
}
return maxScore;
}
}class Solution {
public int maxScore(String s) {
int n = s.length(), nOnes = 0, maxScore = 0, score;
byte[] binary = new byte[n];
for (int i = 0; i < n; i++) {
binary[i] = (byte)(s.charAt(i) - '0');
nOnes += binary[i];
}
score = nOnes;
for (int i = 0; i < n - 1; i++) {
if (binary[i] == 0)
score++;
else score--;
maxScore = Math.max(maxScore, score);
}
return maxScore;
}
}class Solution {
public int maxScore(String s) {
int n = s.length(), nOnes = 0, maxScore = 0, score;
byte[] binary = new byte[n];
for (int i = 0; i < n; i++) {
binary[i] = (byte)(s.charAt(i) - '0');
nOnes += binary[i];
}
score = nOnes;
for (int i = 0; i < n - 1; i++) {
if (binary[i] == 0)
score++;
else score--;
maxScore = Math.max(maxScore, score);
}
return maxScore;
}
}