-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy pathSortArrayAbsoluteDifference.java
57 lines (49 loc) · 1.99 KB
/
SortArrayAbsoluteDifference.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
52
53
54
55
56
57
package com.geeksforgeeks.array;
import java.util.*;
import static com.util.LogUtil.getArrayAsString;
import static com.util.LogUtil.logIt;
public class SortArrayAbsoluteDifference {
public static void main(String[] args) {
// int arr[] = {10, 5, 3, 9, 2};
int arr[] = {1, 2, 3, 4, 5};
sortArrayAsAbsoluteDifference(arr, 6);
ArrayRotation.printArray(arr);
arr = new int[]{10, 5, 3, 9, 2};
sortArrayAsAbsoulteDifferenceWithNoExtraSpace(arr, 7);
}
private static void sortArrayAsAbsoluteDifference(int[] arr, int x) {
Map<Integer, List<Integer>> differenceMap = new TreeMap<>();
for (int i = 0; i < arr.length; i++) {
int difference = Math.abs(x - arr[i]);
if (differenceMap.containsKey(difference)) {
List<Integer> members = differenceMap.get(difference);
members.add(arr[i]);
differenceMap.put(difference, members);
} else {
List<Integer> newMembers = new ArrayList<>();
newMembers.add(arr[i]);
differenceMap.put(difference, newMembers);
}
}
System.out.println(differenceMap);
Set<Integer> keys = differenceMap.keySet();
int counter = 0;
for (Integer key : keys) {
List<Integer> members = differenceMap.get(key);
for (Integer member : members) {
arr[counter++] = member;
}
}
}
private static void sortArrayAsAbsoulteDifferenceWithNoExtraSpace(int[] arr, int x) {
logIt("Sorting Array " + getArrayAsString(arr) + " based on Absolute difference with " + x);
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length - 1; j++) {
if (Math.abs(arr[j] - x) > Math.abs(arr[j + 1] - x)) {
QuickSort.swap(arr, j, j + 1);
}
}
}
logIt("After Sorting Array is " + getArrayAsString(arr));
}
}