We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Java
- Data Structures
- Java Sort
- Discussions
Java Sort
Java Sort
Sort by
recency
|
311 Discussions
|
Please Login in order to post a comment
The key point is reduce the code of the comparation core. Here is a example which i think a good exercise.
Collections.sort(studentList, new Comparator<Student>() { public int compare(Student s1, Student s2){ return Comparator.comparing(Student::getCgpa).reversed().thenComparing(Student::getFname).compare(s1,s2); }
import java.util.*;
class Student{ private int id; private String fname; private double cgpa; public Student(int id, String fname, double cgpa) { super(); this.id = id; this.fname = fname; this.cgpa = cgpa; } public int getId() { return id; } public String getFname() { return fname; } public double getCgpa() { return cgpa; } }
//Complete the code public class Solution { public static final List studentList = new ArrayList(); public static void main(String[] args){ Scanner in = new Scanner(System.in); int testCases = Integer.parseInt(in.nextLine());
}