-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
80 lines (75 loc) · 1.96 KB
/
Solution.cs
File metadata and controls
80 lines (75 loc) · 1.96 KB
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
69
70
71
72
73
74
75
76
77
78
79
80
public class Solution
{
public int MaxFrequency(int[] nums, int k, int numOperations)
{
int n = nums.Length;
Array.Sort(nums);
int ans = 0;
Dictionary<int, int> numCount = [];
int lastNumIndex = 0;
for (int i = 0; i < n; i++)
{
if (nums[i] != nums[lastNumIndex])
{
numCount[nums[lastNumIndex]] = i - lastNumIndex;
ans = Math.Max(ans, i - lastNumIndex);
lastNumIndex = i;
}
}
numCount[nums[lastNumIndex]] = n - lastNumIndex;
ans = Math.Max(ans, n - lastNumIndex);
for (int i = nums[0]; i <= nums[^1]; i++)
{
int l = LeftBound(nums, i - k);
int r = RightBound(nums, i + k);
int best = 0;
if (numCount.TryGetValue(i, out int value))
{
best = Math.Min(r - l + 1, value + numOperations);
}
else
{
best = Math.Min(r - l + 1, numOperations);
}
ans = Math.Max(ans, best);
}
return ans;
}
int LeftBound(int[] nums, int val)
{
int n = nums.Length;
int low = 0, high = n - 1, ans = n - 1;
while (low <= high)
{
int mid = low + (high - low) / 2;
if (nums[mid] >= val)
{
ans = mid;
high = mid - 1;
}
else
{
low = mid + 1;
}
}
return ans;
}
int RightBound(int[] nums, int val)
{
int low = 0, high = nums.Length - 1, ans = 0;
while (low <= high)
{
int mid = low + (high - low) / 2;
if (nums[mid] <= val)
{
ans = mid;
low = mid + 1;
}
else
{
high = mid - 1;
}
}
return ans;
}
}