当前位置：网站首页>Daily question 1: numbers that appear more than half of the time in the array (Sword finger offer39)

Daily question 1: numbers that appear more than half of the time in the array (Sword finger offer39)

2022-07-21 02:07:00 【Baking soda】

  Ideas ： utilize hashmap, Store the number of occurrences of each number , When the number of occurrences is greater than half the length of the array , Output the number 

class Solution {
    public int majorityElement(int[] nums) {
            int x = (nums.length)/2;
            HashMap<Integer,Integer> map = new HashMap();
            for(int num : nums){
                if(!map.containsKey(num)){
                    map.put(num,1);
                }else{
                    map.put(num,map.get(num)+1);
                }
                if(map.get(num) > x){
                    return num;
                }
            }
    return -1;
    }
}

原网站

版权声明
本文为[Baking soda]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/202/202207200304555288.html

边栏推荐

猜你喜欢

随机推荐