-
Notifications
You must be signed in to change notification settings - Fork 229
/
Copy path1838-frequency-of-the-most-frequent-element.js
68 lines (61 loc) · 1.2 KB
/
1838-frequency-of-the-most-frequent-element.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
const maxFrequency = function(nums, k) {
nums.sort((a, b) => a - b)
let res = 1
const n = nums.length
let i = 0, sum = 0
for(let j = 1; j < n; j++) {
const e = nums[j]
const delta = e - nums[j - 1]
sum += (j - i) * delta
while(sum > k) {
sum -= e - nums[i]
i++
}
res = Math.max(res, j - i + 1)
}
return res
};
// another
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
const maxFrequency = function(nums, k) {
let res = 1, i = 0, j = 0, sum = 0
const n = nums.length
nums.sort((a, b) => a - b)
for(j = 0; j < n; j++) {
sum += nums[j]
while(sum + k < (j - i + 1) * nums[j]) {
sum -= nums[i]
i++
}
res = Math.max(res, j - i + 1)
}
return res
};
// another
/**
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
const maxFrequency = function(nums, k) {
nums.sort((a, b) => a - b)
let i = 0, sum = 0, res = 1
for(let j = 0; j < nums.length; j++) {
sum += nums[j]
while(sum + k < (j - i + 1) * nums[j]) {
sum -= nums[i]
i++
}
res = Math.max(res, j - i + 1)
}
return res
};