Leetcode每日一题:最高频元素的频数(排序+前缀和+计数)
class Solution {
public:
int maxFrequency(vector<int>& nums, int k) {
int l = 0, res = 1;
typedef long long LL;
LL sum = 0;
sort(nums.begin(), nums.end());
for (int r = 1; r < nums.size(); r ++ )
{
sum += (LL)(nums[r] - nums[r - 1]) * (r - l);
while (sum > k) sum -= (nums[r] - nums[l ++ ]);
res = max(res, r - l + 1);
}
return res;
}
};