-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathComparator.java
61 lines (48 loc) · 1.45 KB
/
Comparator.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
61
import java.util.*;
/*
Name: Sorting: Comparator
Source: HackerRank
Link: https://www.hackerrank.com/challenges/ctci-comparator-sorting/problem
Statement: Given an array of Player objects, write a comparator that sorts them in order of decreasing score.
If n or more players have the same score, sort those players alphabetically ascending by name.
*/
class Player {
String name;
int score;
Player(String name, int score) {
this.name = name;
this.score = score;
}
}
class Checker implements java.util.Comparator<Player> {
// complete this method
public int compare(Player a, Player b) {
if(a.score>b.score){
return -1;
}
else if(a.score <b.score){
return 1;
}
else{
int res = a.name.compareTo(b.name);
return res;
}
}
}
public class Comparator<P> {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
Player[] player = new Player[n];
Checker checker = new Checker();
for(int i = 0; i < n; i++){
player[i] = new Player(scan.next(), scan.nextInt());
}
scan.close();
System.out.println("-------------");
Arrays.sort(player, checker);
for(int i = 0; i < player.length; i++){
System.out.printf("%s %s\n", player[i].name, player[i].score);
}
}
}