Majority Element

最新推荐文章于 2022-04-16 14:23:13 发布

Paul_ZJ

最新推荐文章于 2022-04-16 14:23:13 发布

阅读量321

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode——坚持每天一题

本文链接：https://blog.youkuaiyun.com/shuitawuhen/article/details/42263085

LeetCode——坚持每天一题专栏收录该内容

176 篇文章

订阅专栏

本文介绍了一种使用Java实现的算法，该算法能够在给定数组中找到出现次数超过一半的多数元素。利用HashMap记录每个元素出现的频率，最终找出符合多数条件的元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Majority Element

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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Java代码：

public class Solution {
    public int majorityElement(int[] num) {
        Map map = new HashMap<Integer, Integer>();
		int tmp = 0;
		for (int i = 0; i < num.length; i++) {
			if (!map.containsKey(num[i])) {
				map.put(num[i], 1);
			} else {
				tmp = (Integer) map.get(num[i]);
				tmp = tmp + 1;
				map.put(num[i], tmp);
			}
		}
		tmp = 0;
		int val = 0;
		int key = 0;
		Iterator ite = map.entrySet().iterator();
		while (ite.hasNext()) {
			Map.Entry entry = (Map.Entry) ite.next();
			val = (Integer) entry.getValue();
			if (val > tmp) {
				tmp = val;
				key = (Integer) entry.getKey();
			}
		}

		return key;
    }
}