leetcode169. Majority Element

题目链接：

https://leetcode.com/problems/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.

Example 1:Input: [3,2,3] Output: 3

Example 2:Input: [2,2,1,1,1,2,2] Output: 2

解题思路：

给定一个数组，找出出现次数其中超过一半的元素。

solution 1:遍历，hash，时间复杂度o(n),空间复杂度o(n)

solution 2:排序，查看中位数，时间复杂度o(nlog(n)),空间复杂度o(1)

solution 3: Boyer-Moore Voting Algorithm（多数投票算法）

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int candidate = nums[0];
        int  n = nums.size();
        int ret = 1;
        for(int i =1;i<n;i++){
            if(nums[i]==candidate){
                ret++;
            }
            else{
                ret --;
            }
            if(ret <=0){
                candidate = nums[i];
                ret = 1;
            }
        }
        return candidate;
        
    }
};