-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSortByKeys.java
More file actions
46 lines (39 loc) · 1.37 KB
/
SortByKeys.java
File metadata and controls
46 lines (39 loc) · 1.37 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
package sorting;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.stream.Collectors;
public class SortByKeys {
public static Map<String, Integer> unSortMap = new HashMap<String, Integer>();
static {
unSortMap.put("z", 10);
unSortMap.put("b", 5);
unSortMap.put("a", 6);
unSortMap.put("c", 20);
unSortMap.put("d", 1);
unSortMap.put("e", 7);
unSortMap.put("y", 8);
unSortMap.put("n", 99);
unSortMap.put("g", 50);
unSortMap.put("m", 2);
unSortMap.put("f", 9);
}
public static void main(String[] args) {
print(unSortMap);
Map<String, Integer> sortedMapByKey = unSortMap.entrySet().stream().sorted(Map.Entry.comparingByKey()).collect(
Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue,(oldVal,newVal)->oldVal,LinkedHashMap::new)
);
print(sortedMapByKey);
Map<String, Integer> sortedByValue = unSortMap.entrySet().stream().sorted(Map.Entry.comparingByValue(Comparator.reverseOrder())).collect(
Collectors.toMap(Map.Entry::getKey, Map.Entry::getValue,(oldVal,newVal)->oldVal,LinkedHashMap::new)
);
print(sortedByValue);
}
private static void print(Map<String, Integer> map) {
map.forEach((k,v)->{
System.out.println(k + " " + v);
});
System.out.println("<------------------------------------>");
}
}