當前位置:編程學習大全網 - 源碼下載 - JAVA編程問題使用TreeSet類,實現按照英語成績高低存放2個student對象。

JAVA編程問題使用TreeSet類,實現按照英語成績高低存放2個student對象。

import java.util.Iterator;

import java.util.TreeSet;

public class Test {

public static void main(String[] args) {

TreeSet<Student> students = new TreeSet<>();

students.add(new Student("zhang san", 90));

students.add(new Student("li si", 75));

students.add(new Student("wang wu", 95));

students.add(new Student("zhao liu", 90));

Iterator<Student> iterator = students.iterator();

while (iterator.hasNext()) {

Student student = iterator.next();

System.out.println(student.getName() + " " + student.getEnglish());

}

}

}

class Student implements Comparable<Student> {

private String name;

private int english;

public Student() {

}

public Student(String name, int english) {

this.name = name;

this.english = english;

}

public String getName() {

return name;

}

public void setName(String name) {

this.name = name;

}

public int getEnglish() {

return english;

}

public void setEnglish(int english) {

this.english = english;

}

public int compareTo(Student o) {

if (this.english != o.english) {

return o.english - this.english;

} else {

return this.name.compareTo(o.name);

}

}

}

compareTo的實現方法是,先按照成績由高到低排列,如果成績壹樣那麽就按照姓名排列。

  • 上一篇:java物流項目和電子商務項目的區別
  • 下一篇:編程語言用英語怎麽說?
  • copyright 2024編程學習大全網