packagemulArray;importjava.util.Arrays;publicclass arrayReverse {publicstaticvoidmain(String[] args){int[] arr =newint[7];int len = arr.length;for(int i =0; i < len;++i){
arr[i]=(int)(Math.random()*100);}System.out.println(Arrays.toString(arr));// 翻转int index = len /2;// (奇偶都一样)for(int i =0; i < index;++i){int tmp = arr[i];
arr[i]= arr[len -1-i];
arr[len -1-i]= tmp;}System.out.println(Arrays.toString(arr));}}
求平均数
packagemulArray;importjava.util.Arrays;importjava.util.Scanner;publicclass avg {publicstaticvoidmain(String[] args){int[] arr =newint[6];int index =0;// 下标索引Scanner scan =newScanner(System.in);while(true){
arr[index]= scan.nextInt();// 输入-1截止输入if(arr[index]<0){break;}if(++index >= arr.length){// 下标越界,则扩容// 重新赋值索引
arr =Arrays.copyOf(arr, arr.length +5);}}// 求平均数double sum =0;int cnt =0;for(int i =0; i < arr.length;++i){if(arr[i]<0){break;}
sum += arr[i];
cnt++;}if(cnt ==0)System.out.println("error");elseSystem.out.println("平均数"+ sum/cnt);double avg = sum/cnt;// 输出比平均数大的数字for(int i =0; i < cnt;++i){if(arr[i]> avg){System.out.print(arr[i]+"\t");}}}}
数组倒转思路:以length/2为界限,左右对应位置上的数字交换package mulArray;import java.util.Arrays;public class arrayReverse { public static void main(String[] args) { int[] arr = new int[7]; int len = arr.length; for (int i = 0; i < len; +