輸入n個整數，輸出出現次數大于等于數組長度一半的數

import java.util.HashMap;
import java.util.Scanner;
import java.util.Set;

public class HW08 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String[] str = in.nextLine().split(" ");
        int[] number = new int[str.length];
        for(int i = 0; i < str.length; i++ ){
            number[i] = Integer.parseInt(str[i]);
        }
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i = 0; i < number.length; i++){
            int count = 0;
            for(int j = 0; j < number.length; j++){
                if(number[i] == number[j]){
                    count++;
                }
            }
            map.put(number[i],count);
        }
        Set<Integer> keys = map.keySet();
        for(Integer key : keys){
            if(map.get(key) >= (number.length)/2){
                System.out.println(key);
            }
        }
    }
}