leetcode Majority Element python

Majority Element

 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.

 

python code:

class Solution:
# @param {integer[]} nums
# @return {integer}
def majorityElement(self, nums):
  b={}
  for eachnum in nums:
    if eachnum not in b:
      b[eachnum]=1  #统计每个数值出现的次数,找出出现次数最多的,返回此数值
    else:
      b[eachnum]+=1
  for eachnum in b:
    if b[eachnum]==max(b.values()):
      return eachnum

你可能感兴趣的:(LeetCode)