首页 > 其他分享 >leetcode-1446-easy

leetcode-1446-easy

时间:2022-10-28 16:14:41浏览次数:76  
标签:count int max chars substring 1446 length easy leetcode

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.

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.
Constraints:

1 <= s.length <= 500
s consists of only lowercase English letters.

思路一:遍历字符串,记录最大值

public int maxPower(String s) {
    char[] chars = s.toCharArray();

    char c = chars[0];
    int count = 1;
    int max = 1;
    for (int i = 1; i < chars.length; i++) {
        if (c == chars[i]) {
            count++;
        } else {
            max = Math.max(max, count);
            c = chars[i];
            count = 1;
        }
    }

    return Math.max(count, max);
}

标签:count,int,max,chars,substring,1446,length,easy,leetcode
From: https://www.cnblogs.com/iyiluo/p/16836395.html

相关文章