题目
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.
算法
O(N)
Moore voting algorithm–每找出两个不同的element,就成对删除即count–,最终剩下的一定就是所求的。时间复杂度:O(n)
代码
class Solution {
public:
int majorityElement(vector<int> &num) {
int elem = 0;
int count = 0;
for(int i = 0; i < num.size(); i++) {
if(count == 0) {
elem = num[i];
count = 1;
}
else {
if(elem == num[i])
count++;
else
count--;
}
}
return elem;
}
};