Description
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.
Example 2:
Input: s = "abbcccddddeeeeedcba"
Output: 5
Explanation: The substring "eeeee" is of length 5 with the character 'e' only.
Example 3:
Input: s = "triplepillooooow"
Output: 5
Example 4:
Input: s = "hooraaaaaaaaaaay"
Output: 11
Example 5:
Input: s = "tourist"
Output: 1
Constraints:
- 1 <= s.length <= 500
- s contains only lowercase English letters.
分析
题目的意思是：找出字符串中字符连续出现的最大频率，思路也是很直接，从左到右遍历进行统计字符就行了，当碰到跟前面字符不相等时，则需要置1，重新计数就行了，遍历过程中维护最大频率值res。
代码
class Solution:
def maxPower(self, s: str) -> int:
prev=''
cnt=0
res=1
for ch in s:
if(prev==ch):
cnt+=1
else:
cnt=1
prev=ch
res=max(res,cnt)
return res
参考文献
[LeetCode] solution