优化时间和空间效率：数组中出现次数超过一半的数字

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