LeetCodeSolutions/leetcode1422_MaxScoreSplittingString.java at master · gurpreetsingh91/LeetCodeSolutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
public class leetcode1422_MaxScoreSplittingString {
    public int maxScore(String s) {

        int previousZeroCount=0, previousOneCount = 0, maxScore=0;
        int[] scoreZero = new int[s.length()];
        int[] scoreOne = new int[s.length()];
        int[] scoreTotal = new int[s.length()];

        //storing the count of zeroes from left side
        for (int i=0;i<s.length()-1;i++) {

            if(s.charAt(i) == '0') {
                scoreZero[i] = previousZeroCount + 1;
                previousZeroCount = scoreZero[i];
            }
            else {
                scoreZero[i] = previousZeroCount;
            }
        }

        //storing the count of one from right side
        for(int i=s.length()-1;i>0;i--) {

            if(s.charAt(i) == '1') {
                scoreOne[i] = previousOneCount+1;
                previousOneCount = scoreOne[i];
            }
            else {
                scoreOne[i] = previousOneCount;
            }
        }

        //calculating total score
        for(int i=0;i<s.length();i++) {
            scoreTotal[i] = scoreZero[i] + scoreOne[i];
            if(scoreTotal[i] > maxScore) {
                maxScore = scoreTotal[i];
            }
        }


        return maxScore;
    }

    public static void main(String[] args) {
        String str = "011101";
        leetcode1422_MaxScoreSplittingString obj = new leetcode1422_MaxScoreSplittingString();
        int res = obj.maxScore(str);
        System.out.println(res);


    }
}