LeetCode *** 169. Majority Element
来源:互联网 发布:64位sql安装提示错误 编辑:程序博客网 时间:2024/06/15 22:05
题目:
Given an array of size n, find the majority element. The majority element is the element that appearsmore than ⌊ n/2 ⌋
times.
You may assume that the array is non-empty and the majority element always exist in the array.
分析:
我一开始用的map,然后利用map来判断一共出现次数,但是我看了discuss区别人的做法。。利用more than n/2这个条件得到值,不得不说确实很厉害。
明天好好想一下,回寝室跑步了。
代码:
class Solution {public: int majorityElement(vector<int>& nums) { map<int,int> myMap; for(int i=0;i<nums.size();++i){ myMap[nums[i]]++; if(myMap[nums[i]]>nums.size()/2)return nums[i]; } }};
0 0
- [LeetCode]169.Majority Element
- LeetCode 169.Majority Element
- 【LeetCode】169.Majority Element
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element
- [leetcode] 169.Majority Element
- Leetcode 169. Majority Element
- 【LeetCode】169. Majority Element
- [LeetCode]169. Majority Element
- 169. Majority Element LeetCode
- LeetCode 169. Majority Element
- LeetCode 169. Majority Element
- Leetcode 169. Majority Element
- [LeetCode]169. Majority Element
- 【LeetCode】169. Majority Element
- leetcode 169. Majority Element
- leetcode 169. Majority Element
- [leetcode] 169. Majority Element
- KMP字符串匹配算法(二)—KMP要点和证明
- 整数之循环节点求和
- Django Project在apache部署配置信息
- jQuery 效果(2)——停止动画
- adb shell am start权限问题解决
- LeetCode *** 169. Majority Element
- 将Unicode编码值转换为Unicode字符串
- Git 基本操作
- 进程间传递文件描述符
- 使用内存快照来加速嵌入式系统的启动
- 关于网络请求中无法访问HttpRequestBase
- 蜘蛛牌
- 面试常见问题
- php笔记3 对时间的操作