-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSortedMap1.java
60 lines (40 loc) · 1.62 KB
/
SortedMap1.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
58
59
60
import java.util.Comparator;
import java.util.SortedMap;
import java.util.TreeMap;
public class SortedMap1 {
//Comparator to sort TreeMap by values
public static Comparator<Integer> valueComparator = new Comparator<>() {
@Override
public int compare(Integer k1, Integer k2) {
int compare = (k1).compareTo(k2);
if (k1 == k2)
{
return 0;
}
else
{
return compare;
}
}
};
public static void main(String[] args) {
//Create a TreeMap using valueComparator
SortedMap<Integer,Integer> sortedMap= new TreeMap<>(valueComparator);
//Add key-value pairs to TreeMap
sortedMap.put(1, 10);
sortedMap.put(3, 30);
sortedMap.put(2, 20);
sortedMap.put(4, 40);
//Print the TreeMap
System.out.println(sortedMap);
//Compare
System.out.println(valueComparator.compare(1, 3));
System.out.println(valueComparator.compare(3, 1));
System.out.println(valueComparator.compare(1, 1));
System.out.println(valueComparator.compare(sortedMap.get(1), sortedMap.get(1)));
System.out.println(valueComparator.compare(sortedMap.get(2), sortedMap.get(1)));
System.out.println(valueComparator.compare(sortedMap.get(1), sortedMap.get(2)));
Comparator comp = sortedMap.comparator();
System.out.println(comp);
}
}