[leetcode] 169. Majority Element

最新推荐文章于 2022-11-27 13:47:27 发布

yaozhili_

最新推荐文章于 2022-11-27 13:47:27 发布

阅读量273

点赞数

分类专栏： leetcode解题报告文章标签： leetcode

本文链接：https://blog.csdn.net/yaozhili_/article/details/77871050

版权

leetcode解题报告专栏收录该内容

67 篇文章 0 订阅

订阅专栏

Question:

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.

Solution:

使用map记录每个数字出现的次数，发现符合就返回。

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        map<int, int> m;
        for (int i = 0; i < nums.size(); i++) {
            if (m.find(nums[i]) == m.end()) {
                m[nums[i]] = 1;
            } else {
                m[nums[i]]++;
            }
            if (m[nums[i]] > nums.size()/2) {
                return nums[i];
            }
        }
    }
};