計算元素最多出現次數

計算nums裡面的元素出現最多的次數，如果次數一樣多就相加一起算最大

class Solution:
    def maxFrequencyElements(self, nums: List[int]) -> int:
        ans = Counter(nums)
        ans = sorted(ans.items(),key=lambda x:x[-1],reverse=True)
        nums, counts = zip(*ans)
        ans = Counter(counts)
        for i in ans:
            return ans[i] * i

class Solution:
    def maxFrequencyElements(self, nums: List[int]) -> int:
        # 統計每個元素的頻率
        freq = Counter(nums)
        
        # 找到最大頻率
        max_freq = max(freq.values())
        
        # 統計有多少個元素達到最大頻率，然後乘以最大頻率
        return sum(count for count in freq.values() if count == max_freq)

class Solution:
    def maxFrequencyElements(self, nums: List[int]) -> int:
        freq = Counter(nums)
        max_freq = max(freq.values())
        return max_freq * list(freq.values()).count(max_freq)

• answer

  nums = [1,2,2,3,1,4],ans = 4

  nums = [1,2,3,4,5],ans = 5

  nums = [15],ans = 1

  nums = [10,12,11,9,6,19,11],ans = 2