首页 > 代码库 > LeetCode--Majority Element
LeetCode--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.
You may assume that the array is non-empty and the majority element always exist in the array.
解决方案：
public class Solution {
public int majorityElement(int[] num) {
int n = num.length;
HashMap<Integer, Integer> hsMap = new HashMap<Integer, Integer>();
for (int i = 0; i < n; i++) {
if (hsMap.get(num[i]) == null) {
hsMap.put(num[i], 1);
if (1 > (n / 2)) {
return num[i];
}
} else // hsMap.get(num[i]) != null
{
if ((hsMap.get(num[i]) + 1) > (n / 2)) {
return num[i];
}
hsMap.put(num[i], hsMap.get(num[i]) + 1);
}
}
return -1;
}
}
LeetCode--Majority Element
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。