首页 > 代码库 > Majority Element
Majority Element
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.
题目大意：
找出数组中超过一半的数。
C++实现代码：
#include<iostream>#include<vector>using namespace std;class Solution {public: int majorityElement(vector<int> &num) { if(num.empty()) return -1; int n=num.size(); int i; int index=0; int count=1; for(i=1;i<n;i++) { if(num[i]==num[index]) { count++; } else count--; if(count<0) { count=1; index=i; } } return num[index]; }};int main(){ vector<int> num={3,3,3,3,3,3,1,2,4,5,3,45,2,54}; Solution s; cout<<s.majorityElement(num)<<endl;}
Majority Element
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。