题目链接：1446. 连续字符
from functools import reduce
class Solution:
def maxPower(self, s: str) -> int:
return max(reduce(lambda acc, i: (i, acc[1][:-1] + [acc[1][-1] + 1]) if acc[0] == i else (i, acc[1] + [1]), s, ('#', [0]))[1])=
题目链接：1446. 连续字符
from functools import reduce
class Solution:
def maxPower(self, s: str) -> int:
return max(reduce(lambda acc, i: (i, acc[1][:-1] + [acc[1][-1] + 1]) if acc[0] == i else (i, acc[1] + [1]), s, ('#', [0]))[1])=