《JAVA程序设计》课程作业二姓名:学号:%1. 设计思路:1 •先定义学生student类，其中成员方法有getter和setter方法，Tostring方 法输出学生信息2•定义Graduatestudent类继承student类,相同的部分用super來继承，同 时增加新的屈性3. 创建多个Graduatestudent对彖，录入学生信息时用到Scanner类,从控制 台读取数据创建学生对象，把学生对象添加到集合用Treeset对学生对彖 的学号排序由list.get(i).getScore()^取学生分数For循环得到总分sum,由 list.size()得到集合元索个数，计算得平均分4. 将学生对象添加到Arrylist,构造函数comparator比较学生对象的分数，最 高分和最低分分别对应于LIST的第一和最后一个元素5. 通过Comparator实现学号排序6•遍历集合ts,把数据写到文木文件，用bufferwriter即可实现1. 实验代码：1. //创建学生类class Student {privateintnum;private String name;private String sex;priva teiiYtmge;public Student(intnum,Stringname,Stringsex,int age ){ this•num=num;this•name=name;this•age=age;this•sex=sex;}2 . get ()和set ()函数部分代码:public String getName() {returnname;)publicvoidsetName(String name) { this•name = name;}3 •定义Graduatestudent类继承student类classGraduateStudentextends Student{privateintscore;private String profession;private String tutor;publicGraduateStudent(intnum,Stringname,Stringsex,intage,Stringprofession,St ringtutor,int score){super(num,name,sex,age);this•profession=profession;this•tutor=tutor;this•score=score;public String toString () { //toString函数return"GradumteStudent [score" + score + n r profession" + professiontuto r=n + tutor + f, get Profession () =n + get Profession () getTutor()=u + getTutor() + n, getScore()=n + getScore() getName()=n + getName() + H, getNum()=n + getNum()getSex () =f, + getSex () + n, get Age () = n + get Age ()IVgetClass()=” +getClass () + H, hashcode()=H + hashcode()toString()=” +super.toString() + n J H ;4・//按学号排列publicstaticvoidmain (String[]args) throwsIOException {comparator=newComparatorComparator(){publicint compare(Graduatestudent si , GraduateStudent s2){int n=sl•getNum()-s2 ・ getNum();return n;}；//按分数排列Comparator comparatorl=newComparator(){publiuint compare(GraduateStudent si . GraduateStudent s2){ int n=sl•getScore()-s2•getScore ();return n;TreeSetts = newTreeSet( comparator);ArrayLisGraduateStudent> list=newArrayLisGraduateStudent>();{Collections•sort(list,comparator!); 5 •控制台输入学生信息部分代码：for(int x = 1; x <= 4; x++){Scanner sc = new Scanner (System.in);System, out .printin ("请录入第n+x+M个的学生信息");System, out ・ print In ("学号:n );intnum= sc•nextInt();System. out .printin ( n姓名：”);String name= sc.next ();6.//创建学生对象GraduateStudent s =newGraduateStudent(num# name, sex, age, profession, tutor, score);s.setNum(num);s.setName(name);s•setSex (sex);s ・ setAge(age);s.setProfession (profession);s ・ setTutor (tutor);s•setScore (score);//把学生信息添加到集合ts•add (s);list•add(s);7・//遍历集合，把数据写到文本文件BufferedWriterbw = newBufferedWriter(newFileWriter ("graduatestudents • txt11));bw. write ("学生信息如下:n);bw•newLine ();bw•flush ();bw. write ("学号，姓名,年龄,性别，专业, 导师,分数“)；bw•newLine ();bw・ flush ();for(Graduatestudent s : ts){StringBuildersb = newStringBuilder();sb ・ append(” ")・ append(s.getNum()) .append (n zn) .append(s.getName()) .append(n , n) . append(s.getAge()) .append(u ,n)•append (s•getSex ()) •append(” , H.append(s.getProfession ()) •append(” ,n ) • append (s . getTutor () ) • append (n , 11) . append (s ・ getScore ());bw ・ write(sb ・ toString ());bw ・ newLine ();bw•flush ();//计算平均分)for(int i=O;i comparator=new Comparator(){publicint compare(GraduateStudent si, GraduateStudent s2){int n=sl.getNum()-s2.getNum();return n;}};〃按分数排列Comparator comparatorl二new Comparator(){publicint comparefGraduateStudent si, Graduatestudent s2){int n二sl.getScore()-s2.getScore();return n;}};TreeSet
