leetcode解题报告(21):Majority Element
2017-05-16 18:14
405 查看
描述
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.
分析
用unordered_map来做,以元素值为key,元素个数为value。然后遍历这个map,判断有没有元素个数大于 ⌊ n/2 ⌋,如果有,就返回这个元素,否则继续遍历,直到遍历结束。代码如下:
class Solution { public: int majorityElement(vector<int>& nums) { unordered_map<int,int>m; for(int num : nums) ++m[num]; for(auto it = m.begin(); it != m.end(); ++it){ if(it->second > nums.size() / 2)return it->first; } return 0; } };
相关文章推荐
- 【LeetCode】169. Majority Element(Easy)解题报告
- LeetCode-Majority Element -解题报告
- [Leetcode] 169. Majority Element 解题报告
- [leetcode] 169. Majority Element 解题报告
- LeetCode-Majority Element II-解题报告
- LeetCode 169. Majority Element 解题报告
- LeetCode 169. Majority Element and LeetCode 229. Majority Element II解题报告
- 【LeetCode】Majority Element 解题报告
- LeetCode-Kth Largest Element in an Array-解题报告
- LeetCode 230. Kth Smallest Element in a BST 解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- 【原创】leetCodeOj --- Majority Element 解题报告(脍炙人口的找n个元素数组中最少重复n/2次的元素)
- 【LeetCode】540. Single Element in a Sorted Array 解题报告
- [leetcode] 229. Majority Element II 解题报告
- leetcode 378. Kth Smallest Element in a Sorted Matrix 解题报告
- 【LeetCode】230.Kth Smallest Element in a BST(Medium)解题报告
- [leetcode] 215. Kth Largest Element in an Array 解题报告
- 【LeetCode】27.Remove Element(Easy)解题报告
- LeetCode 169. Majority Element解题方法
- LeetCode Remove Element 解题报告