leetcode_challenges_java/ConsecutiveCharacters.java at main · devdevbadillo/leetcode_challenges_java · 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
/*
    The power of the string is the maximum length of a non-empty substring that contains only one unique character.

    Given a string s, return the power of s.

    Example 1:
        Input: s = "leetcode"
        Output: 2
        Explanation: The substring "ee" is of length 2 with the character 'e' only.

    Example 2:
        Input: s = "abbcccddddeeeeedcba"
        Output: 5
        Explanation: The substring "eeeee" is of length 5 with the character 'e' only.
*/

class Solution {
    public int maxPower(String s) {
        int maxConsecutive = 0;
        int count = 1;

        for(int i = 0; i < s.length(); i++){

            if(i + 1 < s.length() && s.charAt(i) == s.charAt(i+1)){

                count++;

            } else{

                if( maxConsecutive < count ){
                    maxConsecutive = count;
                }

                count = 1;
            }
        }

        return maxConsecutive;
    }
}