Add solution #743

Author: JoshCrozier

README.md

@@ -273,6 +273,7 @@
 733|[Flood Fill](./0733-flood-fill.js)|Easy|
 735|[Asteroid Collision](./0735-asteroid-collision.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|
+743|[Network Delay Time](./0743-network-delay-time.js)|Medium|
 744|[Find Smallest Letter Greater Than Target](./0744-find-smallest-letter-greater-than-target.js)|Easy|
 745|[Prefix and Suffix Search](./0745-prefix-and-suffix-search.js)|Hard|
 746|[Min Cost Climbing Stairs](./0746-min-cost-climbing-stairs.js)|Easy|

solutions/0743-network-delay-time.js

@@ -0,0 +1,42 @@
+/**
+ * 743. Network Delay Time
+ * https://leetcode.com/problems/network-delay-time/
+ * Difficulty: Medium
+ *
+ * You are given a network of n nodes, labeled from 1 to n. You are also given times, a
+ * list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source
+ * node, vi is the target node, and wi is the time it takes for a signal to travel from
+ * source to target.
+ *
+ * We will send a signal from a given node k. Return the minimum time it takes for all
+ * the n nodes to receive the signal. If it is impossible for all the n nodes to receive
+ * the signal, return -1.
+ */
+
+/**
+ * @param {number[][]} times
+ * @param {number} n
+ * @param {number} k
+ * @return {number}
+ */
+var networkDelayTime = function(times, n, k) {
+  const time = new Array(n + 1).fill(Infinity);
+
+  time[k] = 0;
+
+  for (let i = 0; i < n; i++) {
+    for (const [u, v, w] of times) {
+      if (time[u] === Infinity) continue;
+      if (time[v] > time[u] + w) {
+        time[v] = time[u] + w;
+      }
+    }
+  }
+
+  let result = 0;
+  for (let i = 1; i <= n; i++) {
+    result = Math.max(result, time[i]);
+  }
+
+  return result === Infinity ? -1 : result;
+};