Q： 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.
A：
class Solution(object):
def majorityElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
delRepeatSet = set(nums)
for num
in delRepeatSet:
if nums.count(num) > int(len(nums)/
2):
return num
