mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
42 lines
1.6 KiB
HTML
42 lines
1.6 KiB
HTML
<p>The <strong>frequency</strong> of an element is the number of times it occurs in an array.</p>
|
|
|
|
<p>You are given an integer array <code>nums</code> and an integer <code>k</code>. In one operation, you can choose an index of <code>nums</code> and increment the element at that index by <code>1</code>.</p>
|
|
|
|
<p>Return <em>the <strong>maximum possible frequency</strong> of an element after performing <strong>at most</strong> </em><code>k</code><em> operations</em>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,2,4], k = 5
|
|
<strong>Output:</strong> 3<strong>
|
|
Explanation:</strong> Increment the first element three times and the second element two times to make nums = [4,4,4].
|
|
4 has a frequency of 3.</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,4,8,13], k = 5
|
|
<strong>Output:</strong> 2
|
|
<strong>Explanation:</strong> There are multiple optimal solutions:
|
|
- Increment the first element three times to make nums = [4,4,8,13]. 4 has a frequency of 2.
|
|
- Increment the second element four times to make nums = [1,8,8,13]. 8 has a frequency of 2.
|
|
- Increment the third element five times to make nums = [1,4,13,13]. 13 has a frequency of 2.
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,9,6], k = 2
|
|
<strong>Output:</strong> 1
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= k <= 10<sup>5</sup></code></li>
|
|
</ul>
|