leetcode 169 Majority Element

最新推荐文章于 2020-07-15 10:43:05 发布

walter1990

最新推荐文章于 2020-07-15 10:43:05 发布

阅读量291

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/suichen1/article/details/51706237

版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种寻找数组中多数元素的高效算法。多数元素是指在数组中出现次数超过一半的元素。文章提供了一个C++实现的例子，该算法通过遍历数组并使用计数方式找出多数元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
	int majorityElement(vector<int> &nums) {
		int temp = 0, cnt = 0;
		for(int i = 0; i < nums.size(); i++) {
			if(i == 0) {
				temp = nums[i];
				cnt += 1;
			} else {
				if(nums[i]!=temp) {
					cnt-=1;
					if(cnt==0) {
						cnt = 1;
						temp = nums[i];
					}
				}else {
					cnt += 1;
				}
			}
		}

		return temp;
	}
}