-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSort_Array1_inOrderof_Array2_HASHMAP.java
More file actions
48 lines (39 loc) · 1.29 KB
/
Copy pathSort_Array1_inOrderof_Array2_HASHMAP.java
File metadata and controls
48 lines (39 loc) · 1.29 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
import java.util.*;
public class Sort_Array1_inOrderof_Array2_HASHMAP {
static void sortabyb(int arr[], int brr[]) {
int a = arr.length;
int b = brr.length;
int value;
HashMap<Integer, Integer> hm = new HashMap<>();
for (int i = 0; i < a; i++) {
if (hm.containsKey(arr[i])) {
value = hm.get(arr[i]);
hm.put(arr[i], value + 1);
} else
hm.put(arr[i], 1);
}
for (int i = 0; i < b; i++) {
if (hm.containsKey(brr[i])) {
value = hm.get(brr[i]);
for (int j = 0; j < value; j++) {
System.out.print(brr[i] + "\t");
}
hm.remove(brr[i]);
}
}
for (int i = 0; i < a; i++) {
if (hm.containsKey(arr[i])) {
value = hm.get(arr[i]);
for (int j = 0; j < value; j++) {
System.out.print(arr[i] + "\t");
}
hm.remove(arr[i]);
}
}
}
public static void main(String[] args) {
int arr[] = { 2, 1, 2, 5, 7, 1, 9, 3, 6, 8, 8 };
int brr[] = { 2, 1, 8, 3 };
sortabyb(arr, brr);
}
}