输入学生成绩,取它们的平均值,然后通过排名等级的学生

问题描述 投票:-2回答:1

样品输入:

学生1个等级:75 学生2级:85 学生3级:90 学生4级:85 学生5级:90

输出示例:

前1:3学生 学生5 前2:2的学生 学生4 前3:1的学生

Scanner sc = new Scanner(System.in);
int[] grade = new int[5];
int[] gradeClone;

for(int i = 1; i <= 5; i++){
    System.out.print("Enter student " + i + " grade: ");
    grade[i-1] = sc.nextInt();
}

gradeClone = grade.clone();

int failed = 0;

for(int x = 1; x <= 5; x++){

    System.out.print("Student " + x + " Remark = ");

    if(grade[x-1] >= 60){
        System.out.println(" Passed");
    }else{
        System.out.println(" Failed");
        failed++;
    }

}

int total = 0;

for(int a = 0; a < 5; a++){
    total += grade[a];
}

int temp;

for(int j = 0; j < 5; j++){

    for(int k = 1; k < 5; k++){

        if(grade[k-1] < grade[k] ){
            temp = grade[k-1];
            grade[k-1] = grade[k];
            grade[k] = temp;
        }

    }

}
String ranking = failed <= 4 ? " then the ranking is: ": " all failed";
System.out.println("The average is " + total/5 + ranking ); 


int topCount = 5-failed;

for(int a = 1; a < 5; a++){
    if(gradeClone[a-1] == gradeClone[a]){
        --topCount;
    }
}

for(int i = 0; i < 5; i++){
    System.out.println(gradeClone[i]);
}

我不能去的方式来进行排名的。我应该如何去这样做呢?

java arrays loops
1个回答
0
投票

我认为你需要这样的事?从排名最高的标记到最低/最低到最高。顺便说一句,我硬编码的档次,你可以把它改成用户输入。

int[] grade = {50,60,30,40,80};
int temp;
    for (int i = 0; i < grade.length; i++) 
    {
        for (int j = i + 1; j < grade.length; j++) 
        {
            if (grade[i] > grade[j]) 
            {
                temp = grade[i];
                grade[i] = grade[j];
                grade[j] = temp;
            }
        }
    }
    System.out.println("Rank from lowest to highest:");
    for (int i = 0; i < grade.length - 1; i++) 
    {
        System.out.print(grade[i] + "\n");
    }
    System.out.print(grade[grade.length - 1]);

    System.out.println("\n\nRank from highest to lowest:");
    for (int i = 4; i >= 0; i--) 
    {
        System.out.print(grade[i] + "\n");
    }
© www.soinside.com 2019 - 2024. All rights reserved.