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

import java.util.*;
public class Solution {
    public int MoreThanHalfNum_Solution(int [] array) {
        HashMap<Integer, Integer> map = new HashMap<>();
        int length = array.length;

        for (int i = 0; i < length; i++) {
            if (map.containsKey(array[i])) {
                int j = map.get(array[i]) + 1;
                map.put(array[i], j);
            } else {
                map.put(array[i], 1);
            }
        }

        for (int i = 0; i < length; i++) {
            if (map.get(array[i]) > length / 2) {
                return array[i];
            }
        }
        return -1;
    }
}