力扣-169题（Java）-哈希

题目链接：https://leetcode-cn.com/problems/majority-element/
题目如下：

class Solution {
    public int majorityElement(int[] nums) {
        HashMap<Integer,Integer> hashmap=new HashMap<Integer,Integer>();
        int len=nums.length;
        int number=0,count=0;

        for(int i=0;i<len;i++){
            if(hashmap.containsKey(nums[i])==false){
                hashmap.put(nums[i],1);
            }
            else {
                int count1=hashmap.get(nums[i]);
                hashmap.put(nums[i],count1+1);
                if(count1+1>len/2) return nums[i];
            }
        }

        return nums[0];
    }
}