38- Majority Element
来源:互联网 发布:c语言入门经典 编辑:程序博客网 时间:2024/04/30 18:07
- Majority Element My Submissions QuestionEditorial Solution
Total Accepted: 110538 Total Submissions: 268290 Difficulty: Easy
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
思路:so easy
class Solution {public: int majorityElement(vector<int>& nums) { map<int,int> m; int n=nums.size(); if(n==1)return nums[0]; for(int i=0;i<nums.size();++i){ if(m.count(nums[i])){ m[nums[i]]++; if(m[nums[i]]>nums.size()/2)return nums[i]; } else m[nums[i]]=1; } }};
0 0
- 38- 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
- Spring中ApplicationContext的事件机制
- Ubuntu14.04 Opencv2.4.9交叉编译
- Bestcoder #82 Div2 ztr loves lucky numbers(next_permutation)
- 监听应用的启动
- 理解矩阵
- 38- Majority Element
- 【LeetCode】Majority Element 解题报告
- 以太网之物理层
- HDU-4597 Play Game (区间DP)
- 【Unity3d】浅谈异步加载场景
- 【世界是自己的,与他人毫无关系】--杨绛
- ListView加Fragment实现Flyme4.0设置界面
- 课堂笔记之自定义线程池
- pathspec did not match any file known to git