题目描述:
示例 1:
示例 2:
示例 3:
思路:
代码实现:
class Solution {
public int maxFrequency(int[] nums, int k) {
Arrays.sort(nums);
int left = 0, right = 0, count = 0, sum = 0, len = nums.length;
while (right < len) {
if (right > left) {
sum += (right - left) * (nums[right] - nums[right - 1]);
}
while (sum > k && right > left) {
sum -= (nums[right] - nums[left]);
left++;
}
count = Math.max(right - left + 1, count);
right++;
}
return count;
}
}