Repository navigation
Expand file tree
/
Copy pathHeighestUniqueEle.java
More file actions
68 lines (62 loc) · 1.53 KB
/
Copy pathHeighestUniqueEle.java
File metadata and controls
68 lines (62 loc) · 1.53 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
package Java;
import java.util.Scanner;
public class HeighestUniqueEle
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
int ele=heighestUniqueEle(a);
System.out.println("The heighest unique element is: "+ele);
sc.close();
}
public static int heighestUniqueEle(int a[])
{
int j=0,ele=0;
int n[]=new int[a.length];
for(int i=0;i<a.length;i++)
{
int c=0;
for(int k=i+1;k<a.length;k++)
{
if(a[i]==a[k])
c++;
}
n[j++] = c;
}
int m[] = new int[j+1];
int x=0;
for(int k=0;k<j;k++)
{
int count=0;
for(int i=k+1;i<n.length;i++)
{
if (n[k]==n[i])
count++;
}
if (count==0)
m[x++]=n[k];
}
int max=m[0];
for (int i=1;i<m.length;i++)
{
if(m[i]>=max)
max=m[i];
}
for (int i=0;i<a.length;i++)
{
int c=0;
for (int k=0;k<a.length;k++)
{
if(a[i]==a[k])
c++;
}
if (c==max)
ele=a[i];
}
return ele;
}
}