[김도연] Day02

leetcode2/1easy/김도연/Q3402.java

@@ -0,0 +1,18 @@
+package Leetcode.김도연;
+
+public class Q3402 {
+    public int minimumOperations(int[][] grid) {
+        int sum = 0;
+
+        for (int i = 0; i < grid[0].length; i++) {
+            for (int j = 0; j < grid.length-1; j++) {
+                if (grid[j][i] >= grid[j+1][i]) {
+                    sum += grid[j][i] - grid[j+1][i] + 1;
+                    grid[j+1][i] = grid[j][i] + 1;
+                }
+            }
+        }
+
+        return sum;
+    }
+}

leetcode2/2medium/김도연/Q2770.java

@@ -0,0 +1,22 @@
+package Leetcode.김도연;
+
+import java.util.Arrays;
+
+public class Q2770 {
+    public int maximumJumps(int[] nums, int target) {
+        int[] dp = new int[nums.length];
+        Arrays.fill(dp, -1);
+        dp[0] = 0;
+
+        for (int i = 0; i < nums.length; i++) {
+            if (dp[i] == -1) continue;
+
+            for (int j = i + 1; j < nums.length; j++) {
+                if (Math.abs(nums[i] - nums[j]) <= target)
+                    dp[j] = Math.max(dp[j], dp[i] + 1);
+            }
+        }
+
+        return dp[nums.length-1];
+    }
+}