add 2039

fishercoder1534 · fishercoder1534 · commit d082bce4432d · 2021-10-16T18:14:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_2039.java b/src/main/java/com/fishercoder/solutions/_2039.java
@@ -10,6 +10,9 @@
 
 public class _2039 {
     public static class Solution1 {
+        /**
+         * My completely original solution, again, using a pen and paper to visualize my thought process helps out greatly!
+         */
         public int networkBecomesIdle(int[][] edges, int[] patience) {
             int n = patience.length;
             int[] distances = findShortestPathToMasterServer(edges, n);
