[LeetCode] 169. Majority Element

排序，返回中值。

class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        #always exists
        nums.sort()
        return nums[len(nums)//2]

---