题目:
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.
Moore's voting algorithm
每次找出一对不同的元素,从数组中删掉,知道数组为空或只有一种元素,如果存在元素s超过半数,那么剩下的元素一定为元素s。当然也有可能剩下元素并没有超过半数,例如数组【1,2,3】剩余元素3并未超过半数,只要最后遍历数组一遍看剩余元素是否超过半数即可。
本题前提为一定存在 the majority element,不用判断。代码如下:
class Solution {
public:
int majorityElement(vector
& nums) {
int elem=nums[0];
int count =1;
for(int i=1;i
nums.size()/2){
return elem;
}
}
return elem;
}
};