1446.连续字符
题目描述
思路
双指针
根据题意,用双指针扫描即可。
Java实现
class Solution {
public int maxPower(String s) {
int ans = 0;
for (int l = 0, r = 0; l < s.length();) {
while (r < s.length() && s.charAt(r) == s.charAt(l)) {
r ++;
}
ans = Math.max(ans, r - l);
l = r;
}
return ans;
}
}
Python实现
class Solution:
def maxPower(self, s: str) -> int:
l = r = ans = 0
while l < len(s):
while r < len(s) and s[r] == s[l]:
r += 1
ans = max(ans, r - l)
l = r
return ans