g1401_1500.s1446_consecutive_characters.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1401_1500.s1446_consecutive_characters;

// #Easy #String #2022_03_28_Time_3_ms_(30.50%)_Space_42.3_MB_(69.58%)

/**
 * 1446 - Consecutive Characters\.
 *
 * Easy
 *
 * 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 class Solution {
    public int maxPower(String s) {
        int max = 0;
        int i = 0;
        while (i < s.length()) {
            int start = i;
            while (i + 1 < s.length() && s.charAt(i) == s.charAt(i + 1)) {
                i++;
            }
            max = Math.max(max, i - start + 1);
            i++;
        }
        return max;
    }
}