LeetCode 简单操作 | 169. Majority Element

最新推荐文章于 2024-06-06 13:14:27 发布

rical730

最新推荐文章于 2024-06-06 13:14:27 发布

阅读量178

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/rical730/article/details/59491835

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

/*
 * Leetcode169. Majority Element
 * Funtion: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
 * Example:
 * Author: LKJ
 * Date:2016/7/22
 * Hint：求主元素，在数组中出现超过n/2次,，，，中位数一定是主元素
*/
#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;


class Solution {
public:
    int majorityElement(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int len = nums.size();
        int x = nums[len/2];
        int cnt = 0;
        for(vector<int>::iterator it = nums.begin(); it != nums.end(); it++){
            if(*it == x){
                cnt++;
            }
        }
        if(cnt >= (len/2)){
            return x;
        }else{
            return 0;
        }
    }
};

int main(){
    int myarr[5] = {1,1,1,5,6};
    vector<int> myin(myarr,myarr+5);

    int myout;
    Solution SA;
    myout = SA.majorityElement(myin);
    cout << myout << endl;

    return 0;
}