数组中出现次数超过一半的数字

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

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