From b5cbc15bcfe13b3e8a6e45cf0f4e584eddd434d9 Mon Sep 17 00:00:00 2001
From: holic-x <1301996554@qq.com>
Date: Thu, 12 Dec 2024 16:53:50 +0800
Subject: [PATCH] =?UTF-8?q?docs=EF=BC=9A=E3=80=900097-=E5=B0=8F=E6=98=8E?=
 =?UTF-8?q?=E9=80=9B=E5=85=AC=E5=9B=AD=E3=80=91=E8=A1=A5=E5=85=85=20JAVA?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC=E3=80=90=E5=9F=BA=E4=BA=8E=E4=B8=89=E7=BB=B4?=
 =?UTF-8?q?=E6=95=B0=E7=BB=84=E7=9A=84Floyd=E7=AE=97=E6=B3=95=E3=80=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

docs：【0097-小明逛公园】补充 JAVA版本【基于三维数组的Floyd算法】
---
 problems/kamacoder/0097.小明逛公园.md | 65 ++++++++++++++++++++++
 1 file changed, 65 insertions(+)

diff --git a/problems/kamacoder/0097.小明逛公园.md b/problems/kamacoder/0097.小明逛公园.md
index 8b3078fc..27ad0eb9 100644
--- a/problems/kamacoder/0097.小明逛公园.md
+++ b/problems/kamacoder/0097.小明逛公园.md
@@ -424,6 +424,71 @@ floyd算法的时间复杂度相对较高，适合 稠密图且源点较多的
 
 ### Java 
 
+- 基于三维数组的Floyd算法
+
+```java
+public class FloydBase {
+
+    // public static int MAX_VAL = Integer.MAX_VALUE;
+    public static int MAX_VAL = 10005; // 边的最大距离是10^4(不选用Integer.MAX_VALUE是为了避免相加导致数值溢出)
+
+    public static void main(String[] args) {
+        // 输入控制
+        Scanner sc = new Scanner(System.in);
+        System.out.println("1.输入N M");
+        int n = sc.nextInt();
+        int m = sc.nextInt();
+
+        System.out.println("2.输入M条边");
+
+        // ① dp定义（grid[i][j][k] 节点i到节点j 可能经过节点K（k∈[1,n]））的最短路径
+        int[][][] grid = new int[n + 1][n + 1][n + 1];
+        for (int i = 1; i <= n; i++) {
+            for (int j = 1; j <= n; j++) {
+                for (int k = 0; k <= n; k++) {
+                    grid[i][j][k] = grid[j][i][k] = MAX_VAL; // 其余设置为最大值
+                }
+            }
+        }
+
+        // ② dp 推导：grid[i][j][k] = min{grid[i][k][k-1] + grid[k][j][k-1], grid[i][j][k-1]}
+        while (m-- > 0) {
+            int u = sc.nextInt();
+            int v = sc.nextInt();
+            int weight = sc.nextInt();
+            grid[u][v][0] = grid[v][u][0] = weight; // 初始化（处理k=0的情况） ③ dp初始化
+        }
+
+        // ④ dp推导：floyd 推导
+        for (int k = 1; k <= n; k++) {
+            for (int i = 1; i <= n; i++) {
+                for (int j = 1; j <= n; j++) {
+                    grid[i][j][k] = Math.min(grid[i][k][k - 1] + grid[k][j][k - 1], grid[i][j][k - 1]);
+                }
+            }
+        }
+
+        System.out.println("3.输入[起点-终点]计划个数");
+        int x = sc.nextInt();
+
+        System.out.println("4.输入每个起点src 终点dst");
+
+        while (x-- > 0) {
+            int src = sc.nextInt();
+            int dst = sc.nextInt();
+            // 根据floyd推导结果输出计划路径的最小距离
+            if (grid[src][dst][n] == MAX_VAL) {
+                System.out.println("-1");
+            } else {
+                System.out.println(grid[src][dst][n]);
+            }
+        }
+    }
+}
+```
+
+
+
 ### Python
 
 基于三维数组的Floyd