Given an array of size n, find the majority element. The majority element is the element that appearsmore than⌊ n/2 ⌋ times.
You may assume that the array is non-empty and the majority element always exist in the array.
代码：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; }};新闻热点
疑难解答
