feat: add solutions to lc problem: No.3033

solution/3000-3099/3033.Modify the Matrix/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int[][] modifiedMatrix(int[][] matrix) {
+        int r = matrix.length;
+        int c = matrix[0].length;
+        for (int i = 0; i < c; i++) {
+            int maxs = Integer.MIN_VALUE;
+            for (int j = 0; j < r; j++) {
+                maxs = Math.max(maxs, matrix[j][i]);
+            }
+            for (int j = 0; j < r; j++) {
+                if (matrix[j][i] == -1) {
+                    matrix[j][i] = maxs;
+                }
+            }
+        }
+        return matrix;
+    }
+}