Given a&nbsp;string s&nbsp;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.

&nbsp;
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


&nbsp;
Constraints:


	2 &lt;= s.length &lt;= 500
	The string s consists of characters '0' and '1' only.


class Solution:
    def maxScore(self, s: str) -> int:
        m0=0
        m1=0
        for i in s:
            if i=="0":
                m0+=1
            else:
                m1+=1
        if m0==0 or m1==0:
            return max(m0-1,m1-1)
        l=len(s)
        i=0
        max_=0
        c0=0
        c1=m1
        idx=-1
        while i <l:
            if s[i]=="0":
                c0+=1
            else:
                c1-=1
            if max_<c1+c0:
                max_=c1+c0
                idx=i
            max_=max(max_,c1+c0)
            i+=1
        if idx==l-1:
            return max_-1
        return max_
class Solution {
    public int maxScore(String s) {
        int max =0;
        for(int i =0; i<s.length()-1; i++)
            max = Math.max(max,s.substring(0,i+1).replace("1","").length()+s.substring(i+1).replace("0","").length());
        
        return max;
    }
}
class Solution {
public:
    int maxScore(string s) {
        int ones = 0;
        int res = -s.length();
        for (int i = 0; i < s.length() - 1; i++) {
            if (s[i] == '1') ones += 2;
            if (i - ones > res) res = i - ones;
        };

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

        return ones + res + 1;
    }
};
 * @param {string} s
 * @return {number}
 */
var maxScore = function(s) {
    const leftScores = []
    const rightScores = []
    let score = 0
    for (let i = 0; i < s.length-1; i++) {
        if (s[i] === '0') 
            score++
        leftScores.push(score)
    }
    score = 0
    for (let i = s.length-1; i > 0; i--) {
        if (s[i] === '1')
            score++
        rightScores.unshift(score)
    }
    
    const scores = leftScores.map((val, idx) => val + rightScores[idx])
    return Math.max(...scores)
};
Maximum Score After Splitting a String