class Solution {
public int projectionArea(int[][] grid) {
int row = grid.length;
int col = grid[0].length;
int maxr = 0;
int res = 0;
for(int i=0;i<row;i++){
maxr = 0;
for(int j=0;j<col;j++){
if(grid[i][j]>0){
res++;
}
maxr = Math.max(maxr,grid[i][j]);
}
res += maxr;
}
int maxc = 0;
for(int j=0;j<col;j++){
maxc = 0;
for(int i=0;i<row;i++){
maxc = Math.max(maxc,grid[i][j]);
}
res += maxc;
}
return res;
}
}
就是计算非零的个数+每行的最大值+每列的最大值击败100%