{"id":10104,"date":"2024-01-15T17:56:31","date_gmt":"2024-01-16T01:56:31","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=10104"},"modified":"2024-01-15T17:58:47","modified_gmt":"2024-01-16T01:58:47","slug":"leetcode-3005-count-elements-with-maximum-frequency","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/hashtable\/leetcode-3005-count-elements-with-maximum-frequency\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 3005. Count Elements With Maximum Frequency"},"content":{"rendered":"\n

You are given an array nums<\/code> consisting of positive<\/strong> integers.<\/p>\n\n\n\n

Return the total frequencies<\/strong> of elements in<\/em> <\/em>nums<\/code> such that those elements all have the maximum<\/strong> frequency<\/em>.<\/p>\n\n\n\n

The frequency<\/strong> of an element is the number of occurrences of that element in the array.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [1,2,2,3,1,4]\nOutput:<\/strong> 4\nExplanation:<\/strong> The elements 1 and 2 have a frequency of 2 which is the maximum frequency in the array.\nSo the number of elements in the array with maximum frequency is 4.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,2,3,4,5]\nOutput:<\/strong> 5\nExplanation:<\/strong> All elements of the array have a frequency of 1 which is the maximum.\nSo the number of elements in the array with maximum frequency is 5.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums.length <= 100<\/code><\/li>
  • 1 <= nums[i] <= 100<\/code><\/li><\/ul>\n\n\n\n
    Solution: Hashtable<\/strong><\/h2>\n\n\n\n
    Use a hashtable to store the frequency of each element, and compare it with a running maximum frequency. Reset answer if current frequency is greater than maximum frequency. Increment the answer if current frequency is equal to the maximum frequency.<\/p>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(n)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n\/\/ Author: Huahua\n
    \nclass Solution {\npublic:\n  int maxFrequencyElements(vector& nums) {\n    unordered_map m;\n    int freq = 0;\n    int ans = 0;\n    for (int x : nums) {\n      if (++m[x] > freq)\n        freq = m[x], ans = 0;\n      if (m[x] == freq)\n        ans += m[x];\n    }\n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[70],"tags":[222,24,82],"class_list":["post-10104","post","type-post","status-publish","format-standard","hentry","category-hashtable","tag-easy","tag-frequency","tag-hashtable","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/10104","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=10104"}],"version-history":[{"count":3,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/10104\/revisions"}],"predecessor-version":[{"id":10108,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/10104\/revisions\/10108"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=10104"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=10104"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=10104"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}