zoukankan      html  css  js  c++  java
  • 【Leetcode】807. Max Increase to Keep City Skyline

    Description

    In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amounts can be different for different buildings). Height 0 is considered to be a building as well.

    At the end, the "skyline" when viewed from all four directions of the grid, i.e. top, bottom, left, and right, must be the same as the skyline of the original grid. A city's skyline is the outer contour of the rectangles formed by all the buildings when viewed from a distance. See the following example.

    What is the maximum total sum that the height of the buildings can be increased?

    **Example:**
    Input: grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]]
    Output: 35
    Explanation: 
    The grid is:
    [ [3, 0, 8, 4], 
      [2, 4, 5, 7],
      [9, 2, 6, 3],
      [0, 3, 1, 0] ]
    
    The skyline viewed from top or bottom is: [9, 4, 8, 7]
    The skyline viewed from left or right is: [8, 7, 9, 3]
    
    The grid after increasing the height of buildings without affecting skylines is:
    
    gridNew = [ [8, 4, 8, 7],
                [7, 4, 7, 7],
                [9, 4, 8, 7],
                [3, 3, 3, 3] ]
    
    

    Notes:

    • 1 < grid.length = grid[0].length <= 50.
    • All heights grid[i][j] are in the range [0, 100].
    • All buildings in grid[i][j] occupy the entire grid cell: that is, they are a 1 x 1 x grid[i][j] rectangular prism.

    Discuss

    先求出该矩阵的skyline,这样可以得到每个节点的skyline最小值,遍历矩阵的每一个元素,与最小值的差值就是增加建筑物高度的总和。

    Code

    class Solution {
        public int maxIncreaseKeepingSkyline(int[][] grid) {
            if (grid == null || grid.length == 0 || grid[0].length == 0) { return 0; }
            int m = grid.length;
            int n = grid[0].length;
            int[] col = new int[m];
            int[] row = new int[n];
            for (int i = 0; i < m; i++) {
                int max = Integer.MIN_VALUE;
                for (int j = 0; j < m; j++) {
                    if (grid[i][j] > max) { max = grid[i][j]; }
                }
                col[i] = max;
            }
            for (int i = 0; i < n; i++) {
                int max = Integer.MIN_VALUE;
                for (int j = 0; j < m; j++) {
                    if (grid[j][i] > max) { max = grid[j][i]; }
                }
                row[i] = max;
            }
            int sum = 0;
            for (int i = 0; i < m; i++) {
                for (int j = 0; j < n; j++) {
                    int tmp = Math.min(col[i], row[j]);
                    if (grid[i][j] <= tmp) { sum += tmp - grid[i][j]; }
                }
            }
            return sum;
        }
    }
    
    
  • 相关阅读:
    C语言成长学习题(八)
    C语言成长学习题(七)
    C语言成长学习题(六)
    C语言成长学习题(五)
    Linux下zookeeper下载与安装教程
    Linux下mongoDB下载与安装
    并发容器之阻塞队列DelayQueue的使用案例及源码分析
    原子操作CAS-最小的线程安全
    ThreadLocal定义、使用案例及源码分析
    mac上使用git命令上传项目工程源码至Github/gitee
  • 原文地址:https://www.cnblogs.com/xiagnming/p/9377883.html
Copyright © 2011-2022 走看看