数组反转
public class FANZHUAN {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr = new int[] { 2, 162, 595, 9562, 15, 4, 256, 623, };
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
fanzhuan(arr);
// int[] arr1 = new int[8]; 没有调用方法时
// if (arr.length == arr1.length) {
//
// for (int i = 0; i < arr.length; i++) {
// arr1[7 - i] = arr[i];
// }
// }
// for (int i = 0; i < arr1.length; i++) {
// System.out.print(arr1[i] + " ");
// }
}
public static void fanzhuan(int a[]) {
int[] b = new int[a.length];
int c = 0;
for (int i = a.length - 1; i >= 0; i--) {
b[c++] = a[i];
}
for (int i = 0; i < a.length; i++) {
System.out.print(b[i] + " ");
}
}
// 也可以借助第三个数d实现届时不需要另外开辟一个数组
// 例如d=a.length-i ,e=0
/**
* e=arr[a];arr[a]=arr[d];arr[d]=e
*/
}
评委打分
import java.util.Scanner;
public class PINGWEDAFEN {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner inScanner = new Scanner(System.in);
int a = inScanner.nextInt();// 多少人
int[] arr = new int[a];
for (int i = 0; i < arr.length; i++) {
arr[i] = inScanner.nextInt();
}
double n = pingjun(arr);
System.out.println(n);
// }不调用
// Arrays.sort(arr);
// double c = 0;
// for (int i = 1; i < arr.length - 1; i++) {// 去除最高分最低分
// c += arr[i];
// }
// double d = c / (arr.length - 2);
// System.out.println(d);
}
public static double pingjun(int[] a) {
double b = 0.0;
double c = 0.0;
if (a.length == 1) {
b = a[0];
}
if (a.length == 2) {
b = (a[0] + a[1]) / 2;
} else {
for (int i = 1; i < a.length - 1; i++) {// 去除最高分最低分
c += a[i];
}
b = c / (a.length - 2);
}
return b;
}
}
按照进度要去看看类和对象了,算法重要可以后大概率是要向项目靠拢,毕竟老师主要教的是这一块,
仅用于记录