挖个坑,今晚在看哈莉奎因的新电影,有时间回来补做题过程。
package LeetCode.FiveHundredOneToOneThousand;
public class EightHundredAndNightTwo {
public int surfaceArea(int[][] grid) {
int len = grid.length;
int sum = 0;
for (int i = 0; i < len; i++){
for (int j = 0; j < len; j++){
sum += i - 1 >= 0 ? Math.max(grid[i][j] - grid[i - 1][j], 0) : grid[i][j];
sum += j - 1 >= 0 ? Math.max(grid[i][j] - grid[i][j - 1], 0) : grid[i][j];
sum += i + 1 < len ? Math.max(grid[i][j] - grid[i + 1][j], 0) : grid[i][j];
sum += j + 1 < len ? Math.max(grid[i][j] - grid[i][j + 1], 0) : grid[i][j];
sum += 2 * (grid[i][j] > 0 ? 1 : 0);
}
}
return sum;
}
}