packagecom.arr;publicclass arr {publicstaticvoidmain(String[] args){//反转一个数组,输出格式为[a,b,c,d]//算法思路:a.交换第一个元素和最后一个元素;start<=end时结束;// b.倒着遍历输出就可以了int[] list =newint[]{12,334,53,5,444,54};//调用reversereverse(list);printArray(list);}//定义方法反转{返回值:void;参数:arr[]}publicstaticvoidreverse(int arr[]){//定义遍历交换for(int start =0, end = arr.length -1; start <= end; start++, end--){//交换元素int temp = arr[start];
arr[start]= arr[end];
arr[end]= temp;}}//输出格式化publicstaticvoidprintArray(int[] arr){System.out.print("[");for(int i =0; i < arr.length; i++){if(i == arr.length -1){System.out.print(arr[i]);}elseSystem.out.print(arr[i]+",");}System.out.println("]");}}//输出结果展示[54,444,5,53,334,12]
2.评委打分问题
2.1去掉一个最高分,去掉一个最低分,最后输出最后平均分
packagecom.arr;importjava.util.Scanner;publicclass arr {publicstaticvoidmain(String[] args){//反转一个数组,输出格式为[a,b,c,d]//算法思路:a.交换第一个元素和最后一个元素;start<=end时结束;// b.倒着遍历输出就可以了int[] list =newint[6];Scanner sc =newScanner(System.in);for(int i =0; i < list.length; i++){System.out.println("请输入第"+(i +1)+"个评委打分为: ");
list[i]= sc.nextInt();}int max =max(list);int min =min(list);int sum =sum(list);int avg =(sum - max - min)/(list.length -2);System.out.println("评委打分总和为:"+sum);System.out.println("去掉一个最低分:"+min);System.out.println("去掉一个最高分:"+max);System.out.println("选手最后得分为:"+avg);//printArray(list);}//sumpublicstaticintsum(int[] arr){int sum =0;for(int i =0; i < arr.length; i++){
sum += arr[i];}return sum;}//minpublicstaticintmin(int[] arr){int min = arr[0];for(int i =0; i < arr.length; i++){if(arr[i]< min){
min = arr[i];}}return min;}//maxpublicstaticintmax(int[] arr){int max = arr[0];for(int i =0; i < arr.length; i++){if(arr[i]> max){
max = arr[i];}}return max;}//输出格式化publicstaticvoidprintArray(int[] arr){System.out.print("[");for(int i =0; i < arr.length; i++){if(i == arr.length -1){System.out.print(arr[i]);}elseSystem.out.print(arr[i]+",");}System.out.println("]");}}//结果展示
评委打分总和为:429
去掉一个最低分:44
去掉一个最高分:99
选手最后得分为:71[99,88,77,66,55,44]