package array; import java.util.HashMap; import java.util.Map; /** * @ProjectName: leetcode * @Package: array * @ClassName: Array17_10 * @Author: markey * @Description: * @Date: 2020/5/28 21:47 * @Version: 1.0 */ public class Array17_10 { public int majorityElement(int[] nums) { Map map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { map.put(nums[i], map.getOrDefault(nums[i], 0) + 1); if (map.get(nums[i]) > nums.length / 2) { return nums[i]; } } return -1; } }