118 - 学生类

118 - 学生类

Time Limit: 1000   Memory Limit: 65535
Submit: 940  Solved: 446

Description

有一个学生类的结构如下：
class Student {
	private int no;
	private String name;
        private int score;
	
	public Student(int _no, String _name, int _score) {
		no = _no;
		name = _name;
                score = _score;
	}
        public int getNo() {return no;}
        public String getName() {return name;}
        public int getScore() {return score;}
	
	public void print(){
		System.out.println(no + " "+name+" "+score);
	}
}

请构造main函数完成如下功能：
从键盘中读入三个学生的信息，比较他们的成绩，按照成绩由高到低排列输出

Input

三个学生的学号、姓名、成绩

Output

由高到低排列输出的三个学生信息

Sample Input

1 wang 89
2 liu 78
3 ma 90

Sample Output

3 ma 90
1 wang 89
2 liu 78

Post Append Code

class Student {
    private int no;
    private String name;
        private int score;
    
    public Student(int _no, String _name, int _score) {
        no = _no;
        name = _name;
                score = _score;
    }
        public int getNo() {return no;}
        public String getName() {return name;}
        public int getScore() {return score;}
    
    public void print(){
        System.out.println(no + " "+name+" "+score);
    }
}

 

import java.util.Scanner;
public class Main{
    public static void main(String[] args) 
    {
    	Student[] s = new Student[3];
         Scanner scan = new Scanner(System.in);     
         int i;
         for(i = 0; i < 3; i++)
         {
        	 int no = scan.nextInt();
             String name = scan.next();
             int score = scan.nextInt();
             s[i] = new Student(no, name, score);
         }
         sort(s);
         for(i=0; i<3; i++){
             s[i].print();
         }
    }
    public static void sort(Student[] s) 
    {
    	int i,j;
        Student tmp;
        for(i=0; i<2; i++)
        {
            for(j=1; j<3; j++)
            {
                if(s[i].getScore() < s[j].getScore())
                {
                    tmp = s[i];
                    s[i] = s[j];
                    s[j] = tmp;
                }
            }
        }
    }
}