169. 多数元素

题目来源：leetcode 169

class Solution {
    public int majorityElement(int[] nums) {
        Map<Integer,Integer> map = new HashMap();
        for (int i = 0; i < nums.length; i++) {
            int times = 0;
            if(map.containsKey(nums[i])){
                continue;
            }
            for(int j = i;j<nums.length;j++){
                if(nums[j] == nums[i]){
                    times++;
                }
            }
            map.put(nums[i],times);
            if(map.get(nums[i])>(nums.length/2)){
                return nums[i];
            }
        }
        return 0;
    }
}