LeetCode - 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. #python #optiomal #interview Solution: class Solution(object): def majorityElement(self, nums): nums.sort() return nums[len(nums)/2] """ :type nums: List[int] :rtype: int """