From 0c5d1e4a4ba45723f41e6987cc295dbe2415299d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E6=B4=AA=E7=90=A6=E7=9A=93?= <2879869829@qq.com>
Date: Fri, 7 Apr 2023 21:30:23 +0800
Subject: [PATCH 1/2] 0407

---
 .../0406.md"                                  |   0
 .../0407.md"                                  | 105 ++++++++++++++++++
 2 files changed, 105 insertions(+)
 rename "21 \346\264\252\347\220\246\347\232\223/04 \346\225\260\347\273\204\344\275\234\344\270\232 A.md" => "21 \346\264\252\347\220\246\347\232\223/0406.md" (100%)
 create mode 100644 "21 \346\264\252\347\220\246\347\232\223/0407.md"

diff --git "a/21 \346\264\252\347\220\246\347\232\223/04 \346\225\260\347\273\204\344\275\234\344\270\232 A.md" "b/21 \346\264\252\347\220\246\347\232\223/0406.md"
similarity index 100%
rename from "21 \346\264\252\347\220\246\347\232\223/04 \346\225\260\347\273\204\344\275\234\344\270\232 A.md"
rename to "21 \346\264\252\347\220\246\347\232\223/0406.md"
diff --git "a/21 \346\264\252\347\220\246\347\232\223/0407.md" "b/21 \346\264\252\347\220\246\347\232\223/0407.md"
new file mode 100644
index 0000000..a8da506
--- /dev/null
+++ "b/21 \346\264\252\347\220\246\347\232\223/0407.md"	
@@ -0,0 +1,105 @@
+1,定义一个方法，接收一个数组，返回该数组的最大值和最小值；在主方法中打印最大，最小值
+
+```java
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class D1 {
+    public static void main(String[] args) {
+        int[] arr=new int[5];
+        int k;
+        Scanner sc=new Scanner(System.in);
+        System.out.println("请输入五个数");
+        for (k=0;k<arr.length;k++){
+            arr[k]=sc.nextInt();
+        }
+        int[] arr3=xxx(arr);
+        System.out.println(Arrays.toString(arr3));
+        System.out.println("此数组最大值为"+arr3[0]);
+        System.out.println("此数组最小值为"+arr3[1]);
+    }
+    public static int[] xxx(int[] a) {
+        int i=0;
+        int o=0;
+        int max=a[i];
+        int min=a[o];
+        for (;i<a.length;i++){
+            if (max<a[i]){
+                max=a[i];
+            }
+        }
+        for (;o<a.length;o++){
+            if(min>a[o]){
+                min=a[o];
+            }
+        }
+        int[] arr2={max,min};
+        return arr2;
+    }
+}
+```
+
+2,定义一个方法，接收长和宽，返回一个矩形的面积，在主方法中，打印这个面积
+
+```java
+import java.util.Scanner;
+
+public class d2 {
+    public static void main(String[] args) {
+        int i;
+        int[] o=new int[2];
+        Scanner z=new Scanner(System.in);
+        System.out.println("请输入长和宽");
+        for(i=0;i<2;i++){
+            o[i]=z.nextInt();
+        }
+        int mianji=xxx(o[0],o[1]);
+        System.out.println(mianji);
+    }
+    public static int xxx(int a,int b){
+        int c=a*b;
+        return c;
+    }
+}
+```
+
+3，利用方法重载，定义多个同名方法，通过接收一个不同类型的参数，方法体里用扫描器接收一个对应类型的值，最后将该输入的值返回，在主方法中，输出该值。
+
+```java
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class D1 {
+    public static void main(String[] args) {
+        int[] arr=new int[5];
+        int k;
+        Scanner sc=new Scanner(System.in);
+        System.out.println("请输入五个数");
+        for (k=0;k<arr.length;k++){
+            arr[k]=sc.nextInt();
+        }
+        int[] arr3=xxx(arr);
+        System.out.println(Arrays.toString(arr3));
+        System.out.println("此数组最大值为"+arr3[0]);
+        System.out.println("此数组最小值为"+arr3[1]);
+    }
+    public static int[] xxx(int[] a) {
+        int i=0;
+        int o=0;
+        int max=a[i];
+        int min=a[o];
+        for (;i<a.length;i++){
+            if (max<a[i]){
+                max=a[i];
+            }
+        }
+        for (;o<a.length;o++){
+            if(min>a[o]){
+                min=a[o];
+            }
+        }
+        int[] arr2={max,min};
+        return arr2;
+    }
+}
+```
\ No newline at end of file
-- 
Gitee


From e56c9d5a225333d4427bfd1b615d15bcc60f2431 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E6=B4=AA=E7=90=A6=E7=9A=93?= <2879869829@qq.com>
Date: Mon, 10 Apr 2023 23:00:28 +0800
Subject: [PATCH 2/2] 0410

---
 .../0410.md"                                  | 34 +++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 "21 \346\264\252\347\220\246\347\232\223/0410.md"

diff --git "a/21 \346\264\252\347\220\246\347\232\223/0410.md" "b/21 \346\264\252\347\220\246\347\232\223/0410.md"
new file mode 100644
index 0000000..8f0401d
--- /dev/null
+++ "b/21 \346\264\252\347\220\246\347\232\223/0410.md"	
@@ -0,0 +1,34 @@
+```java
+public class Employee {
+    int a;
+    String name;
+    int old;
+    double qian;
+
+    public void one(){
+        System.out.println("第一个员工编号:" + a+",姓名"+name+",年龄："+old+"，薪资"+qian);
+    }
+    public void two(){
+        System.out.println("第二个员工编号:" + a+",姓名"+name+",年龄："+old+"，薪资"+qian);
+    }
+}
+public class ingogo {
+    public static void main(String[] args) {
+        Employee c= new Employee();
+        c.a=1;
+        c.name="张三";
+        c.old=23;
+        c.qian=10000;
+        c.one();
+        Employee k =new Employee();
+        k.a=2;
+        k.name="李四";
+        k.old=22;
+        k.qian=11000;
+        k.two();
+
+    }
+}
+
+```
+
-- 
Gitee