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.

解释：

这里我用了一个字典，记录每个数字出现的次数

代码：

class Solution(object):    def majorityElement(self, nums):        """        :type nums: List[int]        :rtype: int        """        ans = {}        nums_mid = len(nums)/2        for i in nums:            if i in ans.keys():                ans[i]+=1            else:                ans[i] = 1            if ans[i]>nums_mid:                return i        return Nonea = Solution()print a.majorityElement([2,3,4,5,2,2])