class Solution {
public static int majorityElement(int[] nums) {
Map<Integer,Integer> map = new HashMap<Integer,Integer>();
for(int i=0;i<nums.length;i++){
if(!map.containsKey(nums[i])){
map.put(nums[i],1);
}else{
map.put(nums[i],map.get(nums[i])+1);
}
}
Map<Integer, Integer> result = new LinkedHashMap<>();
map.entrySet().stream()
.sorted(Map.Entry.<Integer, Integer>comparingByValue().reversed())
.forEachOrdered(x -> result.put(x.getKey(), x.getValue()));
return (int) result.keySet().toArray()[0];
}
}
求数组中的最多数元素
最新推荐文章于 2023-02-10 23:50:41 发布