[leetcode] most elements [169]

problem :  Given a size of n Array of nums, Return most of the elements ( Most elements refer to the number of occurrences in an array Greater than n/2 The elements of )

You can assume that the array is not empty , And there are always many elements in a given array

Example 1

Input : nums = [3,2,3]

Output : 3

Example 2

Input : nums = [2,2,1,1,1,2,2]

Output : 2

Python3 Problem solving  

#  solution 1
def majorityElement(nums):
   length = len(nums) / 2
   set_nums = set(nums)
   for i in set_nums:
       if nums.count(i) > length:
           return i

#  solution 2
import collections
def majorityElement(nums):
    counts = collections.Counter(nums)
    return max(counts.keys(), key=counts.get)

majorityElement([3,2,3]) # 3
majorityElement([2,2,1,1,1,2,2]) # 2

Knowledge points involved :

[Python] set() function https://blog.csdn.net/Hudas/article/details/122882024
[Python] count() Method https://blog.csdn.net/Hudas/article/details/122941544