Given an array
nums
of sizen
, return the majority element.The majority element is the element that appears more than
⌊n / 2⌋
times. You may assume that the majority element always exists in the array.
class Solution:
def majorityElement(self, nums):
for n in set(nums):
if nums.count(n) > len(nums) // 2:
return n