28 lines
537 B
Go
28 lines
537 B
Go
// Package q3005 implements a solution for https://leetcode.com/problems/count-elements-with-maximum-frequency/
|
|
package q3005
|
|
|
|
import "slices"
|
|
|
|
func maxFrequencyElements(nums []int) int {
|
|
slices.Sort(nums)
|
|
maxFreq := 0
|
|
nMaxFreq := 0
|
|
|
|
freq := 1
|
|
for i := 1; i <= len(nums); i++ {
|
|
if i < len(nums) && nums[i] == nums[i-1] {
|
|
freq++
|
|
} else {
|
|
if freq > maxFreq {
|
|
maxFreq = freq
|
|
nMaxFreq = 1
|
|
} else if freq == maxFreq {
|
|
nMaxFreq++
|
|
}
|
|
freq = 1
|
|
}
|
|
}
|
|
return maxFreq * nMaxFreq
|
|
}
|
|
|
|
var _ = maxFrequencyElements
|