From 298a8addc0c5ff951a2703fdb375cc2ddcc1ead8 Mon Sep 17 00:00:00 2001
From: xuxin <840198532@qq.com>
Date: Fri, 18 Sep 2026 14:14:25 +0800
Subject: [PATCH] =?UTF-8?q?day05--.=E6=95=B0=E7=BB=84=E4=BD=9C=E4=B8=BA?=
 =?UTF-8?q?=E6=96=B9=E6=B3=95=E8=BF=94=E5=9B=9E=E5=80=BC=5F=E8=BF=94?=
 =?UTF-8?q?=E5=9B=9E=E5=9C=B0=E5=9D=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 day05/src/com/inmind/array01/Demo09.java | 90 ++++++++++++++++++++++++
 1 file changed, 90 insertions(+)
 create mode 100644 day05/src/com/inmind/array01/Demo09.java

diff --git a/day05/src/com/inmind/array01/Demo09.java b/day05/src/com/inmind/array01/Demo09.java
new file mode 100644
index 0000000..4815059
--- /dev/null
+++ b/day05/src/com/inmind/array01/Demo09.java
@@ -0,0 +1,90 @@
+package com.inmind.array01;
+/*
+数组作为方法返回值_返回地址
+ */
+public class Demo09 {
+    public static void main(String[] args) {
+        int[] arr = {1,2,3,4,5,6,7};
+        //1.打印原数组
+        printArr(arr);
+        System.out.println("-------------------");
+        //2.调用获取偶数新数组的方法
+        int[] newArr = getOsArray(arr);
+        //3.打印新数组
+        //创建相同长度的数组，只获取偶数保存返回 [2,4,6]
+        printArr(newArr);
+    }
+    //定义一个方法，传入一个数组，将数组中的偶数，封装起来，并将只含有偶数的新数组返回回来
+    public static int[] getOsArray(int[] arr) {
+        //先获取偶数的数量
+        int osCount = getOsCount(arr);
+
+        //动态初始化一个偶数的数量长度整数数组
+        int[] newArr = new int[osCount];
+        int index = 0;//对新数组的索引，手动管理
+
+        //遍历判断是偶数则保存到新数组中
+        for (int i = 0; i < arr.length; i++) {
+            int temp = arr[i];//遍历时，每个元素
+            if (temp % 2 == 0) {
+                newArr[index++] = temp;
+            }
+        }
+        return newArr;
+    }
+
+    //定义一个获取整数数组中偶数的数量
+    public static int getOsCount(int[] arr) {
+        int count = 0;
+        for (int i = 0; i < arr.length; i++) {
+            int temp = arr[i];
+            if (temp % 2 == 0) {
+                count++;
+            }
+        }
+        return count;
+    }
+
+
+
+
+    //方式二
+    public static int[] getOsArray2(int[] arr) {
+        //动态初始化一个整数数组
+        int[] newArr = new int[arr.length];
+        int index = 0;//对新数组的索引，手动管理
+
+        //遍历判断是偶数则保存到新数组中
+        for (int i = 0; i < arr.length; i++) {
+            int temp = arr[i];//遍历时，每个元素
+            if (temp % 2 == 0) {
+                newArr[index++] = temp;
+            }
+        }
+        return newArr;
+    }
+
+
+    //方式一
+    public static int[] getOsArray1(int[] arr) {
+        //动态初始化一个整数数组
+        int[] newArr = new int[arr.length];
+        //遍历判断是偶数则保存到新数组中
+        for (int i = 0; i < arr.length; i++) {
+            int temp = arr[i];//遍历时，每个元素
+            if (temp % 2 == 0) {
+                newArr[i] = temp;
+            }
+        }
+        return newArr;
+    }
+
+
+    public static void printArr(int[] arr){
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i]+"-");
+        }
+        System.out.println();
+    }
+
+}