蓝桥杯算法提高VIP-分数统计-题解（Java代码）（用集合写出来的）

解题思路:

注意事项:

参考代码:

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Collections;

import java.util.Scanner;

public class Main {

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

//

Scanner scanner=new Scanner(System.in);

int [] arr=new int[scanner.nextInt()];

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

arr[i]=scanner.nextInt();

}

int [] a1=new int[1000];

int [] a2=new int[1000];

int [] a3=new int[1000];

int [] a4=new int[1000];

int [] a5=new int[1000];

int num=0;

int num1=0;

int num2=0;

int num3=0;

int num4=0;

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

if (arr[i]>=90) {

num++;

a1[i]=arr[i];

}

else if(arr[i]>=80){

num1++;

a2[i]=arr[i];

}

else if(arr[i]>=70){

num2++;

a3[i]=arr[i];

}

else if(arr[i]>=60){

num3++;

a4[i]=arr[i];

}

else {

num4++;

a5[i]=arr[i];

}

}

ArrayList<Integer> list=new ArrayList<Integer>();

list.add(num);//比较大小

list.add(num1);

list.add(num2);

list.add(num3);

list.add(num4);

for (Integer add : list) {

System.out.print(add+" ");

}

System.out.println();

System.out.println(Collections.max(list));

if (num==Collections.max(list)) {逆向思维找出num相等的值 然后在比较输出上方fu的新值

for (int i = 0; i < a1.length-1; i++) {

if (a1[i]==0) {

return;

}

else {

System.out.println(a1[i]);

}

}

}

Arrays.sort(a1);//排序

Arrays.sort(a2);

Arrays.sort(a3);

Arrays.sort(a4);

Arrays.sort(a5);

if (num==Collections.max(list)) {

for (int i = a1.length-1; i>=0 ; i--) {

if (a1[i]==0) {//为0的时候返回

return;

}

System.out.println(a1[i]);

}

}

if (num1==Collections.max(list)) {

for (int i = a2.length-1; i>=0 ; i--) {

if (a2[i]==0) {

return;

}

System.out.println(a2[i]);

}

}

if (num2==Collections.max(list)) {

for (int i = a3.length-1; i>=0 ; i--) {

if (a3[i]==0) {

return;

}

System.out.println(a3[i]);

}

}

if (num3==Collections.max(list)) {

for (int i = a4.length-1; i>=0 ; i--) {

if (a4[i]==0) {

return;

}

System.out.println(a4[i]);

}

}

for (int i = a5.length-1; i>=0 ; i--) {

if (a5[i]==0) {

return;

}

System.out.println(a5[i]);

}

}

}