Get the majority element from a given array of integers containing duplicates
// check whether `A[i]` is a majority element or not
for (int i = 0; i <= n/2; i++)
{
int count = 1;
for (int j = i + 1; j < n; j++)
{
if (A[j] == A[i]) {
count++;
}
}
if (count > n/2) {
return A[i];
}
}
return -1;Get the majority element from a given array of integers containing duplicates
public static int findMajorityElement(int[] A)
{
// create an empty `HashMap`
Map<Integer, Integer> map = new HashMap<>();
// store each element's frequency in a map
for (int i: A) {
map.put(i, map.getOrDefault(i, 0) + 1);
}
// return the element if its count is more than `n/2`
for (Map.Entry<Integer, Integer> entry: map.entrySet())
{
if (entry.getValue() > A.length/2) {
return entry.getKey();
}
}
// no majority element is present
return -1;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
