题目要求如下:
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(nlogn)的方法,忽略了这道题的最优解,应该是O(N)当时的思路是sort,然后取中间的元素,就是解,相当elegant的解,但是效率不高。
或者用hashmap,虽然时间复杂度也是O(N),但是空间复杂度比较大,所以看了看讨论区,这个应该是最优解,时间复杂度O(n),空间复杂度O(1):
class Solution {
public:
int majorityElement(vector<int> &num) {
int len = num.size();
int count = 0;
int cache = 0;
for (int i = 0; i < len; ++i) {
if (count == 0) {
cache = num[i];
++count;
}
else {
if (cache == num[i])
++count;
else
--count;
}
}
return cache;
}
};
基本算法就是:如果遇到两个不同的元素,会成对删除,最后cache里的元素就是答案
比如1,2,3,1,1
最开始1,cache = 1,count = 1
2,cache = 1,count = 0
3, cache = 3, count = 1
1, cache = 3, count = 0
1, cache = 1, count = 1