From 00405e519283b681daca6bb0f9dc5d292c1cc9ab Mon Sep 17 00:00:00 2001
From: Allen Guo <allenguo166@gmail.com>
Date: Wed, 7 Aug 2024 07:13:31 -0700
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B00094.=E5=9F=8E=E5=B8=82?=
 =?UTF-8?q?=E9=97=B4=E8=B4=A7=E7=89=A9=E8=BF=90=E8=BE=93I.md=20Java?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC=E8=A7=A3=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../kamacoder/0094.城市间货物运输I.md  | 57 +++++++++++++++++++
 1 file changed, 57 insertions(+)

diff --git a/problems/kamacoder/0094.城市间货物运输I.md b/problems/kamacoder/0094.城市间货物运输I.md
index f72bfc00..45ca1313 100644
--- a/problems/kamacoder/0094.城市间货物运输I.md
+++ b/problems/kamacoder/0094.城市间货物运输I.md
@@ -392,6 +392,63 @@ Bellman_ford 是可以计算 负权值的单源最短路算法。
 ## 其他语言版本
 
 ### Java 
+```Java
+public class Main {
+
+    // Define an inner class Edge
+    static class Edge {
+        int from;
+        int to;
+        int val;
+        public Edge(int from, int to, int val) {
+            this.from = from;
+            this.to = to;
+            this.val = val;
+        }
+    }
+
+    public static void main(String[] args) {
+        // Input processing
+        Scanner sc = new Scanner(System.in);
+        int n = sc.nextInt();
+        int m = sc.nextInt();
+        List<Edge> edges = new ArrayList<>();
+
+        for (int i = 0; i < m; i++) {
+            int from = sc.nextInt();
+            int to = sc.nextInt();
+            int val = sc.nextInt();
+            edges.add(new Edge(from, to, val));
+        }
+
+        // Represents the minimum distance from the current node to the original node
+        int[] minDist = new int[n + 1];
+
+        // Initialize the minDist array
+        Arrays.fill(minDist, Integer.MAX_VALUE);
+        minDist[1] = 0;
+
+        // Starts the loop to relax all edges n - 1 times to update minDist array
+        for (int i = 1; i < n; i++) {
+
+            for (Edge edge : edges) {
+                // Updates the minDist array
+                if (minDist[edge.from] != Integer.MAX_VALUE && (minDist[edge.from] + edge.val) < minDist[edge.to]) {
+                    minDist[edge.to] = minDist[edge.from] + edge.val;
+                }
+            }
+        }
+
+        // Outcome printing
+        if (minDist[n] == Integer.MAX_VALUE) {
+            System.out.println("unconnected");
+        } else {
+            System.out.println(minDist[n]);
+        }
+    }
+}
+
+```
 
 ### Python