LeetCode807.保持城市天际线_题解

Dec.13th.2021每日一题：（JAVA）

class Solution {
    public int maxIncreaseKeepingSkyline(int[][] grid) {
        int n = grid.length;
        int sum=0;
        int row_max[] = new int[n];
        int col_max[] = new int[n];
        for(int i=0;i<n;i++){
            row_max[i] = max(grid[i]);
            for(int j=0;j<n;j++){
                if(grid[i][j]>col_max[j]){
                    col_max[j]=grid[i][j];
                }
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                sum+=(row_max[i]-grid[i][j])>(col_max[j]-grid[i][j])?(col_max[j]-grid[i][j]):(row_max[i]-grid[i][j]);
            }
        }
        return sum;
    }
    int max(int []array){
        int max=0;
        for(int i=0;i<array.length;i++){
            if(array[i]>max) max=array[i];
        }
        return max;
    }
}