奥古斯都

class Solution: def maxSatisfied(self, customers: List[int], grumpy: List[int], X: int) -> int: size = len(customers) Sum_pre = 0 #不生气的状态下有多少顾客 for i in range(len(grumpy)): if grumpy[i]==0: ...

class Solution: def longestSubarray(self, nums: List[int], limit: int) -> int: #利用第三方库，将列表有序化，底层其实是一个最小堆 from sortedcontainers import SortedList left, right = 0, 0 size = len(nums) s = SortedLi...

class Solution: def characterReplacement(self, s: str, k: int) -> int: res = 0 right,left = 0,0 size = len(s) counter = Counter() while right<size: counter[s[right]]+=1 #在一个窗口内...

class Solution: def findMaxConsecutiveOnes(self, nums: List[int]) -> int: #滑动窗口法 res = 0 i = 0 windows = [] tmp = 0 while i<len(nums): if nums[i]!=0: ...