Majority Element
来源:互联网 发布:vscode 真机调试 编辑:程序博客网 时间:2024/03/29 15:21
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.
1、题目解析:
主要是用到了hash表来存放数字出现的次数
int majorityElement(vector<int> &num) {map<int,int> numCount;int len = num.size();if(len == 1){return num[0];}int threshold = len/2;for(int i=0;i<len;i++){if(numCount.find(num[i]) == numCount.end()){numCount[num[i]] = 1;}else{numCount[num[i]] = numCount[num[i]] + 1;if(numCount[num[i]] > threshold){return num[i];}}}}
0 0
- 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 SDK Manager下载太慢问题
- 将打发后方尽快哈安居客后方尽快哈就卡掉发货
- 7种形式的Android Dialog使用举例
- Java实现敏感词过滤
- Majority Element
- [从jQuery看JavaScript]-匿名函数与闭包(Anonymous Function and Closure)
- 签名验证相关说明
- c语言二维字符数组的初始化和赋值
- appfuse初始页面加载慢的问题
- Java时间日期格式转换
- Web_JavaScript_JQuery_JQuery参考知识;
- [LeetCode]110.Balanced Binary Tree
- 远程连接Mysql服务器