标签：c++ leetcode 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.
解答：
寻找主元素。主元素有几个性质：
class Solution {
public:
int majorityElement(vector<int>& nums) {
int count = 0;
int major = nums[0];
for(int i = 0; i < nums.size(); i++)
{
if(count == 0){
major = nums[i];
count++;
}
else if(major == nums[i]){
count++;
}
else{
count--;
}
}
return major;
}
};版权声明：本文为博主原创文章，转载请联系我的新浪微博 @iamironyoung
【LeetCode从零单刷】Majority Element
标签：c++ leetcode majority element
原文地址：http://blog.csdn.net/ironyoung/article/details/49018251
