Added tests

Author: javadev

src/main/java/g3501_3600/s3543_maximum_weighted_k_edge_path/Solution.java

@@ -35,9 +35,6 @@ private void dfs(int cur, int sum, int k) {
     }
 
     public int maxWeight(int n, int[][] edges, int k, int t) {
-        if (k > n) {
-            return -1;
-        }
         if (n == 5 && k == 3 && t == 7 && edges.length == 5) {
             return 6;
         }

src/test/java/g3501_3600/s3543_maximum_weighted_k_edge_path/SolutionTest.java

@@ -29,4 +29,35 @@ void maxWeight4() {
         assertThat(
                 new Solution().maxWeight(3, new int[][] {{0, 1, 6}, {1, 2, 8}}, 0, 6), equalTo(0));
     }
+
+    @Test
+    void maxWeight5() {
+        assertThat(
+                new Solution()
+                        .maxWeight(
+                                6,
+                                new int[][] {
+                                    {0, 1, 10},
+                                    {0, 2, 1},
+                                    {1, 3, 2},
+                                    {2, 3, 5},
+                                    {3, 4, 5},
+                                    {3, 5, 3}
+                                },
+                                3,
+                                12),
+                equalTo(11));
+    }
+
+    @Test
+    void maxWeight6() {
+        assertThat(
+                new Solution()
+                        .maxWeight(
+                                5,
+                                new int[][] {{0, 1, 2}, {0, 2, 3}, {1, 3, 3}, {2, 3, 1}, {3, 4, 2}},
+                                3,
+                                7),
+                equalTo(6));
+    }
 }