27.数组元素重复度过数组长度一半

import java.util.HashMap;
import java.util.Map;

public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {
           if(array.length == 0) {
               return 0;
           }
        
        if(array.length == 1) {
            return array[0];
        }
            
        
        Map<Integer, Integer> hashmap = new HashMap<>();
        for(int i = 0; i < array.length; i++) {
            if(!hashmap.containsKey(array[i])) {
                hashmap.put(array[i],1);
            }else{
                if(hashmap.get(array[i]) == Math.floor((double)array.length/2)) {
                    return array[i];
                }else {
                    hashmap.put(array[i],hashmap.get(array[i])+1);
                }
            }
        }
        return 0;
    }
}