Skip to content

Commit 392f4bd

Browse files
refactor 743
1 parent d6f8678 commit 392f4bd

File tree

1 file changed

+0
-16
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-16
lines changed

src/main/java/com/fishercoder/solutions/_743.java

-16
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,5 @@
11
package com.fishercoder.solutions;
22

3-
/**
4-
* 743. Network Delay Time
5-
*
6-
* There are N network nodes, labelled 1 to N.
7-
*
8-
* Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v is the target node, and w is the time it takes for a signal to travel from source to target.
9-
*
10-
* Now, we send a signal from a certain node K. How long will it take for all nodes to receive the signal? If it is impossible, return -1.
11-
*
12-
* Note:
13-
* * N will be in the range [1, 100].
14-
* * K will be in the range [1, N].
15-
* * The length of times will be in the range [1, 6000].
16-
* * All edges times[i] = (u, v, w) will have 1 <= u, v <= N and 0 <= w <= 100.
17-
*/
18-
193
public class _743 {
204
public static class Solution1 {
215
public static final int MAX = 100_00_00;

0 commit comments

Comments
 (0)