[LeetCode] 169. Majority Element

题目内容

https://leetcode-cn.com/problems/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.

Example 1:

Input: [3,2,3]
Output: 3
Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

---

题目思路

这道题目就是要选择出一个数字，该数字在数组中出现的次数大于数组长度的一半。因为题目已经给出了一定有结果，所以变得容易很多。我们可以先进行排序，然后再长度//2的位置上那个数字一定是所求。

---

程序代码

class Solution(object):
    def majorityElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if len(nums)==1 or len(nums)==2:
            return nums[0]
        nums=sorted(nums)
        #print(nums)
        return nums[len(nums)//2]