LeetCode 169. Majority Element(摩尔投票法)
169. Majority Element
Easy
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.
Examp…
2026/7/28 18:44:31