数组反转1（经典）

package Array;

public class ArrayReverse {
     public static void main(String[] args) {
         //数组反转
         //定义数组
         int[] arr = {11, 22, 33, 44, 55, 66, 77, 885};
         //将{11 22 33 44 55 66 转换为 66 55 44 33 22 11
         int temp = 0;
         int len = arr.length; //计算
         for (int i = 0; i < len / 2; i++) {
             temp = arr[len - 1 -i];   //保存
             arr[len - 1 - i] = arr[i];
             arr[i] = temp;

         }
         System.out.println("===反正后的数组===");
         for (int i = 0; i < arr.length; i++){
             System.out.println(arr[i] + "\t");
         }
     }
}

数组反转1（经典）

原文：https://www.cnblogs.com/xiaoqiang2000/p/14848635.html