OJ---成绩排序

最新推荐文章于 2024-11-21 09:59:30 发布

龍淵

最新推荐文章于 2024-11-21 09:59:30 发布

阅读量277

点赞数

分类专栏： OJ 文章标签： java 算法

本文链接：https://blog.youkuaiyun.com/qq_42420778/article/details/124216481

版权

OJ 专栏收录该内容

46 篇文章

订阅专栏

本文介绍了如何使用Java的Comparator接口创建自定义比较器，以实现学生对象的升序和降序排列，通过`student.up`和`student.down`进行操作。实例展示了如何读取输入并根据指定的排序方式进行学生信息的显示。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.util.*;

class student {
    private int grade;
    private String name;
    public static final Comparator<student> up = new up();
    public static final Comparator<student> down = new down();
    public student(String name, int grade) {
        this.grade = grade;
        this.name = name;
    }
    public String toString() {
        return name + " " + grade;
    }
    //升序排列
    public static class up implements Comparator<student> {
        public int compare(student a, student b) {
            return a.grade - b.grade;
        }
    }
    //降序排列
    public static class down implements Comparator<student> {
        public int compare(student a, student b) {
            return b.grade - a.grade;
        }
    }
}
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int updown = in.nextInt();
        in.nextLine();
        student s[] = new student[n];
        for (int i = 0; i < n; i++) {
            String str[] = in.nextLine().split(" ");
            s[i] = new student(str[0], Integer.valueOf(str[1]));
        }
        if (updown == 0) {
            Arrays.sort(s, student.down);
        }
        if (updown == 1) {
            Arrays.sort(s, student.up);
        }
        for (student student : s) {
            System.out.println(student.toString());
        }
    }
}