169. 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.

 解题思路：
散列

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        if(nums.size()==0) return 0;

        unordered_map<int,int> order;
        for(int i=0;i<nums.size();i++){
            order[nums[i]]++;
            if(order[nums[i]]>nums.size()/2) return nums[i];
        }


    }
};