Description
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 <= 500sconsists of only lowercase English letters.
Solutions
Solution 1: Traversal and Counting
We define a variable t to represent the length of the current consecutive characters, initially t=1.
Next, we traverse the string s starting from the second character. If the current character is the same as the previous character, then t = t + 1, and update the answer ans = max(ans, t); otherwise, set t = 1.
Finally, return the answer ans.
The time complexity is O(n), where n is the length of the string s. The space complexity is O(1).
PythonJavaC++GoTypeScript
class Solution: def maxPower(self, s: str) -> int: ans = t = 1 for a, b in pairwise(s): if a == b: t += 1 ans = max(ans, t) else: t = 1 return ans(code-box)
