Majority Element
来源:互联网 发布:淘宝线下门店有什么用 编辑:程序博客网 时间:2024/06/07 20:48
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.
题目解释:本题难度不大,首先题目定义了一个向量我们需要找出向量中的The majority element,即该元素出现得次数超过⌊ n/2 ⌋,其中n为向量的大小。我的做法就是先调用STL函数sort函数进行排序,然后遍历一次判断每个元素出现的次数并与⌊ n/2 ⌋比较大小,找出The majority element就返回這个数并结束程序.
程序如下:
class Solution {
public:
int majorityElement(vector<int>& nums) {
int n=nums.size();
int t=floor(n/2);
if(n==0) return false;
if(n==1) return nums[0];
else
{
sort(nums.begin(),nums.end());
for(int i=0;i<n;i++)
{
int count=0;
while(nums[i]==nums[i+1])
{
count++;
if(count+1>t) return nums[i];
i++;
}
}
}
}
};
- majority element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- Majority Element
- majority element
- Majority Element
- Majority Element
- 基于Android与STM32的宿舍自动开门神器
- android videoView播放视频,对播放结束的监听方法
- hihoCoder Trie 树
- A Bug's Life 分身法OR 带权并查集
- MySQL12-数据备份与还原
- Majority Element
- 《Head First Javacn》pdf
- python----爬虫
- 机器学习
- s5pv210——nandflash和inand的基础理论
- 反射(一) Reflection
- Android问题集(4):Unable to add window -- token android.os.BinderProxy@bf4921f is not valid;
- 原型模式定义
- PSR-1 (Basic Coding Standard) 基础编码标准