LeetCode：Majority Element

最新推荐文章于 2022-02-21 09:36:56 发布

原创最新推荐文章于 2022-02-21 09:36:56 发布 · 3.5k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #sort

LeetCode 同时被 2 个专栏收录

48 篇文章

订阅专栏

LeetCode

48 篇文章

订阅专栏

本文介绍了一种在给定数组中找到出现次数超过一半的元素的方法。通过排序数组并返回中间元素来解决此问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

// Source : https://oj.leetcode.com/problems/majority-element/
// Author : Chao Zeng
// Date   : 2014-12-22
class Solution {
public:
    int majorityElement(vector<int> &num) {
        int n = num.size();
        sort(num.begin(),num.end());
        return num[n/2];
    }
};