package temp.leetcode.editor.cn;import org.junit.Test;import java.util.Arrays;import java.util.Comparator;classPerson{
int id;public int getId(){return id;}publicvoidsetId(int id){this.id = id;}public int getOp(){return op;}publicvoidsetOp(int op){this.op = op;}public int getEd(){return ed;}publicvoidsetEd(int ed){this.ed = ed;}public int getChair(){return chair;}publicvoidsetChair(int chair){this.chair = chair;}
int op;
int ed;
int chair;}classSolution{publicstatic int smallestChair(int[][] times, int targetFriend){
int[] chair =newint[times.length];//椅子状态
Person[] p =newPerson[times.length];for(int i =0; i < times.length; i++){
p[i]=newPerson();
p[i].setId(i);
p[i].setOp(times[i][0]);
p[i].setEd( times[i][1]);}
Arrays.sort(p,newComparator<Person>(){
@Override
public int compare(Person o1, Person o2){return o1.getOp()- o2.getOp();}});return1;}}
最近刷力扣时,经常想用c/c++的结构体加sort函数自定义排序(那可太快了)。但又想用java写,所以用内部类写了个模板仅供自己参考,如下。package temp.leetcode.editor.cn;import org.junit.Test;import java.util.Arrays;import java.util.Comparator;class Person{ int id; public int getId() { return id