首页 > 代码库 > [LeetCode]169 Majority Element
[LeetCode]169 Majority Element
https://oj.leetcode.com/problems/majority-element/
public class Solution { public int majorityElement(int[] num) { int len = num.length; int minhit = (len / 2) + 1; Map<Integer, Integer> map = new HashMap<>(); for (int i : num) { Integer occur = map.get(i); if (occur == null) occur = 0; occur ++; if (occur >= minhit) return i; else map.put(i, occur); } // throw exception throw new IllegalStateException("input is wrong"); } }
[LeetCode]169 Majority Element
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。