Leetcode之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

代码：

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