#169

Majority Element

pupil · 320 · lc easy +21 · verified · 66.1% accepted · 22,611 likes · top 71%

Description

Given an array nums of size n, return the majority element — the one that appears more than &lfloor;n / 2&rfloor; times. You may assume 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

Code

1

2

3

class Solution:
    def majorityElement(self, nums: List[int]) -> int:

class Solution:
    def majorityElement(self, nums: List[int]) -> int: