<LeetCode><Easy> 169 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.

#Python2  64ms

class Solution(object):
def majorityElement(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
s=list(set(nums))
cs=[nums.count(i) for i in s]
return s[cs.index(max(cs))]