21 2 月, 2022

Last Updated on 2022-02-21 by Clay

題目

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.