1446 - Consecutive Characters

1446 - Consecutive Characters

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.

Examples

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

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

Input: s = "triplepillooooow" Output: 5

Input: s = "hooraaaaaaaaaaay" Output: 11

Input: s = "tourist" Output: 1

Constraints

• 1 <= s.length <= 500

• s consists of only lowercase English letters.

Java Solution

class Solution {
    public int maxPower(String s) {
        int power = 1;
        int currentPower = 1;
        
        for(int i = 1; i < s.length(); i++) {
            if(s.charAt(i) == s.charAt(i-1)){
                currentPower++;
                power = Math.max(currentPower, power);
            } else {
                currentPower = 1;
            }
        }
        
        return power;
    }
}