LeetCode 169 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.java You may assume that the array is non-empty and the majority element a

>>阅读原文<<