106차 1번 문제풀이

Author: Eric

live10/test106/문제1/황장현.js

@@ -10,25 +10,28 @@ function solution(input) {
   const m = input[0][1];
   const busInfo = input.slice(2);
   const map = Array.from({ length: n }, () => Array(n).fill(Infinity));
+
   for (let i = 0; i < n; i++) {
     map[i][i] = 0;
   }
+
   for (const [start, end, cost] of busInfo) {
     map[start - 1][end - 1] = Math.min(map[start - 1][end - 1], cost);
   }
 
-  function backtrack() {}
-
-  for (let i = 0; i < n; i++) {
-    for (let j = 0; j < n; j++) {
-      for (let k = 0; k < n; k++) {
-        if (i === j) continue;
+  for (let k = 0; k < n; k++) {
+    for (let i = 0; i < n; i++) {
+      for (let j = 0; j < n; j++) {
         if (map[i][j] > map[i][k] + map[k][j]) {
           map[i][j] = map[i][k] + map[k][j];
         }
       }
     }
   }
+
+  return map
+    .map((row) => row.map((cost) => (cost === Infinity ? 0 : cost)).join(' '))
+    .join('\n');
 }
 
 console.log(solution(input));