春季赛

Author: Dagon0577

leetcode周赛/春季赛/2. 传递信息.java

@@ -0,0 +1,20 @@
+class Solution {
+    public int numWays(int n, int[][] relation, int k) {
+        int[][] dp = new int[k + 1][n + 1];
+        for(int i = 0;i < relation.length;i++){
+            if(relation[i][0] == 0){
+                dp[1][relation[i][1]] = 1;
+            }
+        }
+        for(int i = 2; i <=k; i++){
+            for(int j = 0;j < n; j++){
+                for(int l = 0; l < relation.length; l++){
+                    if(relation[l][1] == j){
+                        dp[i][j] += dp[i - 1][relation[l][0]];
+                    }
+                }
+            }
+        }
+        return dp[k][n - 1];
+    }
+}

leetcode周赛/春季赛/3. 剧情触发时间.java

@@ -0,0 +1,26 @@
+class Solution {
+    public int[] getTriggerTime(int[][] increase, int[][] requirements) {
+        int[] res = new int[requirements.length];
+        for(int i = 1;i < increase.length; i++){
+            increase[i][0] +=increase[i-1][0];
+            increase[i][1] +=increase[i-1][1];
+            increase[i][2] +=increase[i-1][2];
+        }
+        for(int i = 0; i < requirements.length; i++){
+            for(int j = 0; j < increase.length;j++){
+                if(requirements[i][0] == 0 && requirements[i][1] == 0 &&requirements[i][2] == 0){
+                    res[i] = 0;
+                    break;
+                }
+                if(increase[j][0] >= requirements[i][0] && increase[j][1] >= requirements[i][1] && increase[j][2] >= requirements[i][2] ){
+                    res[i] = j + 1;
+                    break;
+                }
+                if(j == increase.length - 1){
+                    res[i] = -1;
+                }
+            }
+        }
+        return res;
+    }
+}