leetcode 807. 保持城市天际线

熬夜睡醒之后快乐每日一题

今天不难子～

class Solution {
    public int maxIncreaseKeepingSkyline(int[][] grid) {
        int len = grid.length;
        int sum = 0;
        int[] row = new int[len];
        int[] col = new int[len];

        for(int i = 0; i < len; i++){
            for(int j=0; j < len; j++){
                row[i] = Math.max(row[i],grid[i][j]);
                col[j] = Math.max(col[j],grid[i][j]);
            }
        }

        for(int i = 0; i < len ; i++){
            for(int j = 0; j < len; j++){
                sum += Math.min(row[i], col[j]) - grid[i][j];
            }
        }

        return sum;
    }
}