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

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        map<int, int> visited;
        int i;
        for(i=0;i<nums.size();i++){
            visited[nums[i]]++;
            if(visited[nums[i]]>nums.size()/2)
               break;
        }
        return nums[i];
    }
};

LeetCode 169. Majority Element

原文：https://www.cnblogs.com/A-Little-Nut/p/10055797.html