229. Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Note: The algorithm should run in linear time and in O(1) space.
Example 1:
Input: [3,2,3]
Output: [3]
Example 2:
Input: [1,1,1,3,3,2,2,2]
Output: [1,2]
Approach
- 题目大意是从数组重找出现次数大于
n/3
的数,首先出现次数大于n/3
的数最多为两个,然后题目要求用线性的时间和O(1)的空间,所以我们用摩尔投票算法来解,摩尔投票算法原本是解一数组中出现半数以上的数,但可变形为查找出现n/k
以上的数,我们这里就将其变形查找这两个数,因为这两个不一定存在,因为题目没有保证,所以我们最后还是要验证一遍。
Code
class Solution {
public:
vector<int> majorityElement(vector<int>& nums) {
int n = 0, m = 0, i = 0, j = 0;
for (auto &num : nums) {
if (n == num) {
i++;
}
else if (m == num) {
j++;
}
else if (i == 0) {
n = num;
i++;
}
else if (j == 0) {
m = num;
j++;
}
else {
i--;
j--;
}
}
i = j = 0;
for (auto &num : nums) {
if (num == n)i++;
else if (num == m)j++;
}
vector<int>res;
if (i > nums.size() / 3)res.push_back(n);
if (j > nums.size() / 3)res.push_back(m);
return res;
}
};