-
Notifications
You must be signed in to change notification settings - Fork 34
/
multiple_occurence.java
52 lines (44 loc) · 980 Bytes
/
multiple_occurence.java
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
// A simple Java program to group
// multiple occurrences of individual
// array elements
class GFG
{
// A simple method to group all occurrences
// of individual elements
static void groupElements(int arr[], int n)
{
// Initialize all elements as not visited
boolean visited[] = new boolean[n];
for (int i = 0; i < n; i++)
{
visited[i] = false;
}
// Traverse all elements
for (int i = 0; i < n; i++)
{
// Check if this is first occurrence
if (!visited[i])
{
// If yes, print it and all
// subsequent occurrences
System.out.print(arr[i] + " ");
for (int j = i + 1; j < n; j++)
{
if (arr[i] == arr[j])
{
System.out.print(arr[i] + " ");
visited[j] = true;
}
}
}
}
}
/* Driver code */
public static void main(String[] args)
{
int arr[] = {4, 6, 9, 2, 3, 4,
9, 6, 10, 4};
int n = arr.length;
groupElements(arr, n);
}
}