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 m = nums[0]; for (size_t i = 0; i < nums.size(); i++) { if (count == 0) { m = nums[i]; count = 1; } else if (nums[i] != m) { count--; } else { count++; } } return m; } };
原文：http://www.cnblogs.com/wxquare/p/5941254.html