解题思路:
注意事项:
参考代码:
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] arr = new int[n]; int A = 0;int B = 0;int C = 0;int D = 0;int E = 0;//6个阶段的人数 for (int i = 0; i < arr.length; i++) { arr[i] = sc.nextInt(); if (arr[i]>=90) {A++;} else if (arr[i]>=80) {B++;} else if (arr[i]>=70) {C++;} else if (arr[i]>=60) {D++;} else {E++;} } int[] fraction = new int[5];//把各阶段的人数放进数组中 fraction[0] = A;fraction[1] = B;fraction[2] = C;fraction[3] = D;fraction[4] = E; int max = fraction[0];//假设第一个位置就是人数最多的 int key = 0;int box = 0;//声明存储i下标的值 for (int i = 0; i < fraction.length; i++) { if (max < fraction[i]) { max = fraction[i]; key = i; } } //判断key是第几类 if (key==0) {key=90;box = 100;} else if (key==1) {key=80;box = 89;} else if (key==2) {key=70;box = 79;} else if (key==3) {key=60;box = 69;} else {key=0;box = 59;} //开始输出 for (int i = 0; i < fraction.length; i++) { System.out.print(fraction[i]+" "); } System.out.println("\n"+max); Arrays.sort(arr);//排序记得倒着输出 for (int i = arr.length-1; i >= 0 ; i--) { if (arr[i] >= key && arr[i]<=box) { System.out.print(arr[i]+" "); } } } }
0.0分
3 人评分