#2968
Apply Operations to Maximize Frequency Score
master · 1745 · lc hard +32 · verified · 38.6% accepted · 294 likes · top 18%
Description
Given a 0-indexed integer array nums and integer k, in up to k operations you may increment or decrement any element by 1. The score of the array is the highest frequency of any single element.
Return the maximum score achievable.
Example 1:
Input: nums = [1,2,6,4], k = 3
Output: 3
Explanation: We can do the following operations on the array:
- Choose i = 0, and increase the value of nums[0] by 1. The resulting array is [2,2,6,4].
- Choose i = 3, and decrease the value of nums[3] by 1. The resulting array is [2,2,6,3].
- Choose i = 3, and decrease the value of nums[3] by 1. The resulting array is [2,2,6,2].
The element 2 is the most frequent in the final array so our score is 3.
It can be shown that we cannot achieve a better score.
Example 2:
Input: nums = [1,4,4,2,4], k = 0
Output: 3
Explanation: We cannot apply any operations so our score will be the frequency of the most frequent element in the original array, which is 3.
Code
1
2
3