mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 18:07:32 +01:00
17 lines
474 B
Java
17 lines
474 B
Java
|
import java.util.Comparator;
|
||
|
|
||
|
class Solution {
|
||
|
private record Person(String name, int height) {}
|
||
|
|
||
|
public String[] sortPeople(String[] names, int[] heights) {
|
||
|
var people = new Person[names.length];
|
||
|
for (int i = 0; i < names.length; ++i) {
|
||
|
people[i] = new Person(names[i], heights[i]);
|
||
|
}
|
||
|
|
||
|
Arrays.sort(people, Comparator.comparing(p -> ((Person) p).height).reversed());
|
||
|
|
||
|
return Arrays.stream(people).map(p -> p.name).toArray(String[]::new);
|
||
|
}
|
||
|
}
|