LeetCode229. 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]

思路：

本文参考了其他博主的文章，同样使用摩尔投票的方法完成题目中的关于空间的要求，代码如下：

class Solution {
public:
    vector<int> majorityElement(vector<int>& nums) {
		int a = 0, b = 0, count1 = 0, count2 = 0;
		for (int num : nums) {
			if (num == a) count1++;
			else if (num == b) count2++;
			else if (count1 == 0) {a = num; count1++;}
			else if (count2 == 0) {b = num; count2++;}
			else {
				count1--; count2--;
			}
		}
		count1 = 0; count2 = 0;
		for (int num : nums) {
			if (num == a) count1++;
			else if (num == b) count2++;
		}
		vector<int> res;
		if (count1 > nums.size() / 3) res.push_back(a);
		if (count2 > nums.size() / 3) res.push_back(b);
		return res;
    }
};