LeetCode 第186场周赛

周赛小结 P1: 可以统计总的0,1个数,然后从左往右扫,就可以了。看了下数据比较小,就写的很暴力。 from collections import Counter as C class Solution: def maxScore(self, s: str) -> int: n, ret = len(s),0 for i in range(n): if not s[0:i] or not s[i:]: continue ret = max(ret, C(s[0:i])['0'] + C(s[i:])['1