Leetcode题解 169. Majority Element

最新推荐文章于 2023-01-10 08:00:49 发布

Xd_Yu

最新推荐文章于 2023-01-10 08:00:49 发布

阅读量290

点赞数

分类专栏： Leetcode题解文章标签： leetcode

本文链接：https://blog.csdn.net/Xd_Yu/article/details/51164470

版权

Leetcode题解专栏收录该内容

80 篇文章 0 订阅

订阅专栏

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

用hashmap即可搞定。

public static int majorityElement(int[] nums) {
        int count;
        int len = nums.length / 2;
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            if (map.get(nums[i]) != null) {
                count = map.get(nums[i]);
                count++;
                map.put(nums[i], count);
            } else {
                map.put(nums[i], 1);
            }
        }
        Iterator it = map.keySet().iterator();
        while (it.hasNext()) {
            int key = (int) it.next();
            if (map.get(key) > len) {
                return key;
            }
        }
        return -1;
    }