https://leetcode.com/problems/count-elements-with-maximum-frequency/description/
Count Elements With Maximum Frequency - LeetCode
Can you solve this real interview question? Count Elements With Maximum Frequency - You are given an array nums consisting of positive integers. Return the total frequencies of elements in nums such that those elements all have the maximum frequency. The
leetcode.com
1 2 3 4 5 6 | class Solution: def maxFrequencyElements(self, nums: List[int]) -> int: fre_nums = [nums.count(x) for x in nums] max_fre = max(fre_nums) return fre_nums.count(max_fre) | cs |
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode 1207. Unique Number of Occurrences (0) | 2024.01.17 |
|---|---|
| leetcode 2913. Subarrays Distinct Element Sum of Squares I (0) | 2024.01.15 |
| leetcode 917. Reverse Only Letters (0) | 2024.01.13 |
| leetcode 1304. Find N Unique Integers Sum up to Zero (0) | 2024.01.10 |
| leetcode 1636. Sort Array by Increasing Frequency (0) | 2024.01.09 |
댓글