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 numsSize = nums.size(); int times = 0; int res = 0; for(int i=0;i<nums.size();i++){ if(i==0){ res = nums[i]; times = 1; }else{ if(nums[i]!=res){ times--; if(times==0){ res = nums[i]; times = 1; } }else{ times++; } } } return res; } };
原文：http://www.cnblogs.com/zengzy/p/4960642.html