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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

剑指offer上的一题。

class Solution {
public:
    int majorityElement(vector<int> &num) {
        int len = num.size();
        //if(len = 1) return num[0];
        
        int ans = num[0];
        int count = 1;
        for(int i = 1;i < len;i++)
        {
            if(count==0)
            {
                ans = num[i];
                count++;
            }
            else
            {
                if(num[i]!=ans)
                    count--;
                else
                    count++;
            }
        }
        
        return ans;
    }
};