From bebca58c159f70206e27b0fd420159d42766cbfc Mon Sep 17 00:00:00 2001
From: p9zok7cfl <2385348640@qq.com>
Date: Fri, 8 Dec 2023 15:12:43 +0800
Subject: [PATCH] =?UTF-8?q?Delete=20'=E6=B1=89=E8=AF=BA=E5=A1=94.txt'?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 汉诺塔.txt | 27 ---------------------------
 1 file changed, 27 deletions(-)
 delete mode 100644 汉诺塔.txt

diff --git a/汉诺塔.txt b/汉诺塔.txt
deleted file mode 100644
index c53d77a..0000000
--- a/汉诺塔.txt
+++ /dev/null
@@ -1,27 +0,0 @@
-import java.util.Scanner;
-public class hanoi {
-    public static void main(String[] args) {
-        Scanner scanner = new Scanner(System.in);
-        System.out.print("请输入一个数n：");
-        int numDisks= scanner.nextInt();
-        char source = 'A'; // 源柱子
-        char auxiliary = 'B'; // 辅助柱子
-        char target = 'C'; // 目标柱子
-        solveHanoi(numDisks, source, auxiliary, target);
-    }
-
-    public static void solveHanoi(int numDisks, char source, char auxiliary, char target) {
-        if (numDisks == 1) {
-            System.out.println("移动盘子 1 从柱子 " + source + " 到柱子 " + target);
-        } else {
-            // 将numDisks-1个盘子从源柱子移动到辅助柱子，借助目标柱子
-            solveHanoi(numDisks - 1, source, target, auxiliary);
-
-            // 移动最底下的一个盘子到目标柱子
-            System.out.println("移动盘子 " + numDisks + " 从柱子 " + source + " 到柱子 " + target);
-
-            // 将numDisks-1个盘子从辅助柱子移动到目标柱子，借助源柱子
-            solveHanoi(numDisks - 1, auxiliary, source, target);
-        }
-    }
-}
\ No newline at end of file