题解 | #数组中出现次数超过一半的数字#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param numbers int整型一维数组 
     * @return int整型
     */
    public int MoreThanHalfNum_Solution (int[] numbers) {
        // write code here

if(numbers==null||numbers.length==0){
    return 0;
}

if(numbers.length==1){
    return numbers[0];
}
        Map<Integer,Integer>  numberMap=new HashMap();
        int count=0;

        for( int i=0;i<numbers.length;i++){

                   if(numberMap.containsKey(numbers[i])){
                    numberMap.put(numbers[i],numberMap.get(numbers[i])+1);
                 if(numberMap.get(numbers[i]).intValue()>numbers.length/2){
                           count= numbers[i];
                 }

                   }else{
                    numberMap.put(numbers[i],1);
                   }
        }

return count;
    }
    

}