From c286bdbe6c103aadfbedfe1e1b43a5c7eeb42eca Mon Sep 17 00:00:00 2001
From: xuxin <840198532@qq.com>
Date: Thu, 17 Sep 2026 15:06:36 +0800
Subject: [PATCH] =?UTF-8?q?day04--=E6=96=B9=E6=B3=95=5F=E5=AE=9A=E4=B9=89?=
 =?UTF-8?q?=E7=9A=84=E7=BB=83=E4=B9=A0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 day04/src/com/inmind/method01/Test02.java | 51 +++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 day04/src/com/inmind/method01/Test02.java

diff --git a/day04/src/com/inmind/method01/Test02.java b/day04/src/com/inmind/method01/Test02.java
new file mode 100644
index 0000000..6f6bd79
--- /dev/null
+++ b/day04/src/com/inmind/method01/Test02.java
@@ -0,0 +1,51 @@
+package com.inmind.method01;
+/*
+   方法定义的2个明确：
+        1.明确返回值类型
+        2.明确参数列表
+
+案例：
+方法练习1_比较两个整数是否相同
+方法练习2_运算1到n的累和
+方法练习3_打印n遍HelloWorld
+ */
+public class Test02 {
+    public static void main(String[] args) {
+        //调用两个整数是否相同方法
+        int x = 10;
+        int y = 20;
+        boolean result = isEqual(x, y);
+        System.out.println(result);
+        //计算n的累和
+        int sum = getSum(100);
+        System.out.println(sum);
+
+        printN(5);
+    }
+
+    //方法练习1_比较两个整数是否相同
+    public static boolean isEqual(int a,int b) {
+        /*if (a == b) {
+            return true;
+        } else {
+            return false;
+        }*/
+        return  a==b;
+    }
+
+    //方法练习2_运算1到n的累和
+    public static int getSum(int n) {
+        int sum = 0;
+        for (int i = 0; i <= n; i++) {
+            sum += i;
+        }
+        return sum;
+    }
+
+    //方法练习3_打印n遍HelloWorld
+    public static void printN(int n) {
+        for (int i = 0; i < n; i++) {
+            System.out.println("helloworld");
+        }
+    }
+}