1class Solution:2 def maxFrequency(self, nums: List[int], k: int) -> int:3 nums.sort()4 sums, i, ans = 0, 0, 05 for j in range(len(nums)):6 sums += nums[j]7 while nums[j] * (j - i + 1) > sums + k:8 sums -= nums[i]9 i = i + 110 ans = max(ans, j - i + 1)11 return ans
WPM •0 •0
ACC •0 •0
TIME •0