Leetcode 229. Majority Element II (Medium) (cpp)

Niko_Ke

于 2016-07-27 20:35:21 发布

阅读量375

点赞数

分类专栏： Leetcode C++ C++ Leetcode Array 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52049216

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

本文介绍了一个解决LeetCode 229题多数元素 II 的算法，该题要求找出数组中出现次数超过 n/3 的所有元素，并且要求算法的时间复杂度为 O(n)，空间复杂度为 O(1)。通过使用Boyer-Moore投票算法的扩展版本，文章详细解释了如何有效地找到这些多数元素。

摘要由CSDN通过智能技术生成

Leetcode 229. Majority Element II (Medium) (cpp)

Tag: Array

Difficulty: Medium

/*

229. Majority Element II (Medium)

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

Hint:

How many majority elements could it possibly have?
Do you have a better hint? Suggest it!

*/
class Solution {
public:
	vector<int> majorityElement(vector<int>& nums) {
		vector<int> res;
		int res1, res2, num1 = 0, num2 = 0;
		for (int i = 0; i < nums.size(); i++) {
			if (res1 == nums[i]) {
                num1++;
            } else if (res2 == nums[i]) {
                num2++;
            } else if (num1 == 0) {
				res1 = nums[i];
				num1++;
			} else if (num2 == 0) {
				res2 = nums[i];
				num2++;
			} else {
				num1--;
				num2--;
			}
		}
		num1 = 0;
		num2 = 0;
		for (int i = 0; i < nums.size(); i++) {
			if (res1 == nums[i]) {
                num1++;
            } else if (res2 == nums[i]) {
                num2++;
            }
		}
		if (num1 > nums.size() / 3) res.push_back(res1);  
		if (num2 > nums.size() / 3) res.push_back(res2);
		return res;
	}
};