【leetcode】(python)169. Majority Element多数元素

169. Majority Element Easy

Description

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.

Example

• Example 1:

  Input: [3,2,3]
  Output: 3

• Example 2:

  Input: [2,2,1,1,1,2,2]
  Output: 2

题意

求一给定非空数组中元素最多且数量大于n/2的元素。

解体思路1

这题最开始想到的是用字典计数，然后遍历字典求出最大值即可。

code

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        if not nums:
            return None
        dic = collections.defaultdict()
        for i in nums:
            if i not in dic:
                dic[i] = 1
            else:
                d