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.
一·题目分析
题目的目的就是找数组中出现次数超过[n/2]的数,也假设了数组一定存在这样的数。想要找到这样的数,只需要遍历一次就可以了,每找出两个不同的element,就成对删除即count–,最终剩下的一定就是所求的。
二、代码
class Solution {
public:
int majorityElement(vector<int> &num) {
int element = 0;
int count = 0;
for(int i = 0; i < num.size(); i++) {
if(count == 0) {
element = num[i];
count = 1;
}
else {
if(element == num[i])
count++;
else
count--;
}
}
return element;
}
};
三、总结
这是一道比较简单的题目,思路也很清晰,一看就能知道该如何去找