Java
import java.util.Arrays;
/**
* <a href="https://leetcode.cn/problems/modify-the-matrix/">Modify The Matrix</a>
* 数组;矩阵
*/
class Solution {
public int[][] modifiedMatrix(int[][] matrix) {
int m = matrix.length, n = matrix[0].length;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (matrix[i][j] == -1) {
int max = -1;
for (int k = 0; k < m; k++) {
if (matrix[k][j] > max) {
max = matrix[k][j];
}
}
matrix[i][j] = max;
}
}
}
return matrix;
}
}