forked from joharbatta/DataStructure-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminOpAeq.java
More file actions
39 lines (35 loc) · 852 Bytes
/
minOpAeq.java
File metadata and controls
39 lines (35 loc) · 852 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
import java.util.*;
// Minimum operation to make all elements equal in array
public class minOpAeq
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
}
HashMap<Integer,Integer> h=new HashMap<>();
for(int i=0;i<n;i++)
{
if(h.containsKey(arr[i]))
{
h.put(arr[i],h.get(arr[i])+1);
}
else
{
h.put(arr[i],1);
}
}
int max=0;
for(int i:h.keySet())
{
if(max<h.get(i))
{
max=h.get(i);
}
}
System.out.print("Min operations is "+(n-max));
}
}