169. Majority Element

https://leetcode.com/problems/majority-element/

Majority Element - LeetCode

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

 

Example 1:

Input: nums = [3,2,3]

Output: 3

 

Example 2:

Input: nums = [2,2,1,1,1,2,2]

Output: 2

 

Constraints:

• n == nums.length
• 1 <= n <= 5 * 104
• -231 <= nums[i] <= 231 - 1

 

Solution

class Solution:
    def majorityElement(self, nums):
        nums.sort()
        return nums[len(nums) // 2]

• 정렬하고 나면 리스트의 중앙에는 무조건 과반수에 해당하는 수가 있다.
• 이걸 떠올리기가 쉽지 않다.