题目描述:
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋
times.
You may assume that the array is non-empty and the majority element always exist in the array.
思路:
找数组中出现最多次数的数,想到运用字典。
AC代码:
class Solution(object):
def majorityElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
numDict = {}
for num in nums:
if num not in numDict:
numDict[num] = 0
numDict[num] += 1
for key in numDict:
if numDict[key] > len(nums) // 2:
return key