From 4721d63af8ccf73b061b091bdeec5c41c904fe7b Mon Sep 17 00:00:00 2001
From: xuxin <840198532@qq.com>
Date: Sun, 9 Aug 2026 14:02:27 +0800
Subject: [PATCH] =?UTF-8?q?s-day08-=E9=80=92=E5=BD=92=E6=B1=82=E7=B4=AF?=
 =?UTF-8?q?=E5=92=8C=E7=9A=84=E7=BB=83=E4=B9=A0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 s-day08/src/com/inmind/digui02/Demo10.java | 35 ++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 s-day08/src/com/inmind/digui02/Demo10.java

diff --git a/s-day08/src/com/inmind/digui02/Demo10.java b/s-day08/src/com/inmind/digui02/Demo10.java
new file mode 100644
index 0000000..a65d6b0
--- /dev/null
+++ b/s-day08/src/com/inmind/digui02/Demo10.java
@@ -0,0 +1,35 @@
+package com.inmind.digui02;
+/*
+递归求累和的练习
+
+递归代码：
+    1.自己调用自己
+    2.递归代码必须要有结束条件
+
+比如
+5的累和：5+4+3+2+1 = 15
+4的累和：4+3+2+1 = 10
+3的累和：3+2+1 = 6
+2的累和：2+1 = 3
+1的累和：1
+
+数学规律：n的累和：n+(n-1)的累和
+结束条件：1的累和是1
+
+使用递归代码，定义一个求n的累和的方法
+ */
+public class Demo10 {
+    public static void main(String[] args) {
+        int result = getLH(100);
+        System.out.println(result);
+    }
+
+    //递归代码
+    public static int getLH(int n) {
+        //结束条件：1的累和是1
+        if (n == 1) {
+            return 1;
+        }
+        return n + getLH(n - 1);
+    }
+}