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

import java.util.*;
public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {
        if(array.length==0){return array[0];}
        HashMap<Integer,Integer> map=new HashMap<>();
        int sum=0;
        for(int i=0;i<array.length;i++){
            if(!map.containsKey(array[i])){map.put(array[i],1);}
            else {map.put(array[i],map.get(array[i])+1);}
            if(map.get(array[i])>array.length/2){sum=array[i];}
        }
        return sum;
    }
}