Search

2024-03-08 Leetcode Daily Problem

생성일
2024/03/08 11:08
태그
알고리즘
날짜
2024/03/08
3 more properties
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 frequency of an element is the number of occurrences of that element in the array.   Example 1: Input: nums = [1,2,2,3,1,4] Output: 4 Explanation: The elements 1 and 2 have a frequency of 2 which is the maximum frequency in the array. So the number of elements in the array with maximum frequency is 4. Example 2: Input: nums = [1,2,3,4,5] Output: 5 Explanation: All elements of the array have a frequency of 1 which is the maximum. So the number of elements in the array with maximum frequency is 5.   Constraints: * 1 <= nums.length <= 100 * 1 <= nums[i] <= 100
https://leetcode.com/problems/count-elements-with-maximum-frequency/
class Solution: def maxFrequencyElements(self, nums: List[int]) -> int: # let n = lenght of nums # 1. count frequencies of nums, O(n) # 2. find out maximum frequency, O(n) # 3. count the number of max freqs from (#2) and sum up, O(n) # Time Complexity: O(n) # Space Complexity: O(n) cnt = Counter(nums) max_freq = max(cnt.values()) return sum(cnt[x] for x in cnt if cnt[x] == max_freq)
Python
복사