From 3816006eb004e5ae588fc7bed5f06325fb2a9c07 Mon Sep 17 00:00:00 2001
From: xuxin <840198532@qq.com>
Date: Sat, 17 Jan 2026 11:45:48 +0800
Subject: [PATCH] =?UTF-8?q?day05-=E6=95=B0=E7=BB=84=E7=9A=84=E6=93=8D?=
 =?UTF-8?q?=E4=BD=9C=5F=E6=95=B0=E7=BB=84=E9=81=8D=E5=8E=86-=E6=95=B0?=
 =?UTF-8?q?=E7=BB=84=E5=8F=8D=E8=BD=AC=E6=96=B9=E5=BC=8F=E4=BA=8C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 day05/src/com/inmind/array01/Test07.java | 29 +++++++++++++++++++++---
 1 file changed, 26 insertions(+), 3 deletions(-)

diff --git a/day05/src/com/inmind/array01/Test07.java b/day05/src/com/inmind/array01/Test07.java
index 970e048..75a143a 100644
--- a/day05/src/com/inmind/array01/Test07.java
+++ b/day05/src/com/inmind/array01/Test07.java
@@ -2,11 +2,36 @@ package com.inmind.array01;
 //数组的反转： 数组中的元素颠倒顺序，例如原始数组为1,2,3,4,5，反转后的数组为5,4,3,2,1
 public class Test07 {
     public static void main(String[] args) {
+        //方式二：不浪费空间，复杂一点，不创建新数组，在原数组的基础上进行反转
+        int[] arr = {1, 2, 3, 4, 5};
+        //对原数组进行正向遍历查看内容即可
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i]);
+        }
+        System.out.println();
+
+        //定义2个索引，对原数组的内容进行逐个交换，到中间位置时，就反转结束了
+        for (int start = 0, end = arr.length - 1; start < end; start++, end--) {
+            //定义一个变量，来进行交换操作
+            int temp = arr[start];
+            arr[start] = arr[end];
+            arr[end] = temp;
+        }
+        System.out.println("---------------------");
+        //对原数组进行正向遍历查看内容即可
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i]);
+        }
+
+        
+    }
+
+
+    public static void reverse1() {
         //定义一个整数数组
         int[] arr = {1, 2, 3, 4, 5};
         //方式一：浪费空间，简单一点，创建新数组，进行反向遍历赋值
         int[] newArr = new int[arr.length];
-
         /*
             arr1[0] = arr[arr.length - 1];
             arr1[1] = arr[arr.length - 1-1];
@@ -20,7 +45,5 @@ public class Test07 {
         for (int i = 0; i < newArr.length; i++) {
             System.out.println(newArr[i]);
         }
-        
     }
-        //方式二：不浪费空间，复杂一点，不创建新数组，在原数组的基础上进行反转
 }