算法第二周Majority Element[easy]
2017-09-17 19:25
169 查看
Majority Element[Easy]
Description
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.
Analysis
这个问题比较简单,主要是计算数组中数字出现的频率,我使用map来记录数字在数组中出现的次数,要注意本题要求次数大于 ⌊ n/2 ⌋ 次。Solution
class Solution { public: int majorityElement(vector<int>& nums) { map<int, int> record; int l = nums.size()/2; int val = 0; for (auto iter = nums.begin(); iter != nums.end(); iter++) { record[*iter]++; if (record[*iter] > l ) { val = *iter; break; } } return val; } };
相关文章推荐
- 算法课第二周作业 | Majority Element
- (算法分析Week1)Majority Element[Easy]
- 算法系列(13) Leetcode 169 Majority Element
- 15算法课程 169. Majority Element
- 169. Majority Element----Array----Easy----20160925
- 【LeetCode】169. Majority Element (多数投票算法 & 算法迁移能力)
- 【LeetCode】169.Majority Element (Easy)
- Leetcode 169. Majority Element[easy]
- Leetcode解题笔记 169.Majority Element [Easy]
- LeetCode--Majority Element II & 多数投票算法
- [Leetcode 169, Easy] Majority Element
- 第二周:[LeetCode]169. Majority Element
- 169. Majority Element Easy
- Leetcode 169. Majority Element (Easy) (cpp)
- 169. Majority Element 难度:Easy 类别:分治
- 【Divide and Conquer】169. Majority Element(easy)
- LeetCode 169. Majority Element (Easy)
- leetcode 169. Majority Element 多数投票算法(Boyer-Moore Majority Vote algorithm)
- LeetCode--Majority Element II & 多数投票算法
- LeetCode 169. Majority Element (Easy)