Leetcode - Consecutive Characters

https://leetcode.com/problems/consecutive-characters/

Given a string s, the power of the string is the maximum length of a non-empty substring that contains only one unique character.

Return the power of the string.

Example 1:

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

func maxPower(s string) int {
    i := 0
    count := 1
    for i < len(s) {
        j := i + 1
        for j < len(s) && s[j] == s[i] {
            j++
        }
        if j - i > count {
            count = j - i
        }
        i = j
    }
    
    return count
}

• 相关文章
• 全局相关文章