码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] 169 - Majority Element

时间:2015-08-28 13:00:20      阅读:122      评论:0      收藏:0      [点我收藏+]

标签:

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.

 

class Solution {
public:
  int majorityElement(vector<int>& nums) {
#if 0
    std::sort(nums.begin(), nums.end());
    return nums[nums.size() / 2 ];
#else
    unordered_map<int, int> maps;
    int times = (nums.size() + 1) / 2;
    for (auto c : nums) {
      maps[c]++;
      if (maps[c] >= times) {
        return c;
      }
    }
#endif
  }
};

[LeetCode] 169 - Majority Element

标签:

原文地址:http://www.cnblogs.com/shoemaker/p/4765957.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!