Collection framework generic LinkedList TreeSet

//package LinkedList;

import java.util.*;



public class TryLinkedlist {
    

    public static void main(String args[ ]) {
    

        List<Student> list = new LinkedList<Student>();

        list.add(new Student(" Zhang San ",86));

        list.add(new Student(" Li Si ",83));

        list.add(new Student(" Zhaodalong ",89));

        list.add(new Student(" Li Yunlong ",80));

        Iterator<Student> iter=list.iterator();

        int sum=0;

        System.out.println(" Before ordering , Data in the linked list :");

        while(iter.hasNext()){
    

            Student stu=iter.next();

            System.out.println(stu.name+ " achievement :"+stu.score);

        }

        System.out.println(" Sort （ By grade ） after , Data in the linked list :");

        /* Perfect the code ： Use Collection Class sort Method to sort and output —— Attention format */
        Collections.sort(list,new Comparator<Student>(){
    
            public int compare(Student o1, Student o2) {
    
                return o1.score-o2.score;
            }
        });
        Iterator<Student> iter2=list.iterator();
        while(iter2.hasNext()){
    
            Student stu=iter2.next();
            sum+=stu.score;
            System.out.println(stu.name+ " achievement :"+stu.score);
        }
        System.out.println(" Average score :"+sum/list.size());
        /* Perfect the code ： Use Linkedlist Class size Method average score —— Attention format */

    }

}



class Student implements Comparable {
    

    String name;

    int score;

    Student(String name,int score) {
    

        this.name=name;

        this.score=score;

    }

    public int compareTo(Object b) {
    

        Student st=(Student)b;

        return (this.score-st.score);

    }

}

//package TreeSet;

import java.util.*;

public class TryTreeSet{
    

    public static void main(String args[]) {
    

        List<Student> list=new LinkedList<Student>();

        int score []={
    65,76,45,99,77,88,100,79};

        String name[]={
    " Zhang San "," Li Si "," peak season "," Gago "," Why "," Weeks and "," Zhao Li "," Set "};

        for(int i=0;i<score.length;i++){
    

            list.add(new Student(score[i],name[i]));

        }

        Iterator<Student> iter=list.iterator();

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

        while(iter.hasNext()){
    

            Student stu=iter.next();

            mytree.add(stu);

        }

        /* Perfect the code ： take list The data in is input into the tree set */



        Iterator<Student> te=mytree.iterator();


        /* Perfect the code ： Output tree set sorting results */
        while(te.hasNext()){
    
            Student stu=te.next();
            System.out.println(stu.name+" "+stu.english);
        }

    }

}




class Student implements Comparable {
    

    int english=0;

    String name;

    Student(int english,String name) {
    

        this.name=name;

        this.english=english;

    }

    public int compareTo(Object b) {
    

        Student st=(Student)b;

        return (this.english-st.english);

    }

}