Leetcode 807. Max Increase to Keep City Skyline

允许自己偷个懒吧，不想翻译题目了。（英语不好的不要骂我，哈哈）

1. 算法描述

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] ]

2. 思想分析

（1）需要完全理解题目的意思，给出一个n * n的矩阵，确定每行每列的最大数，然后将每个元素相加到最大，但是不能影响原来的从上到下或者从左到右的可以观察到的最大数。
（2）每一行最大数，构建整型数组并且排序，这个数组即为左右天际线；
（3）每一列最大数，构建整形数组并且排序，这个数组即为上下天际线；
（4）遍历左右天际线，同时嵌套循环遍历上下天际线，将二者中较小者，减去当前index对应的grid数组的元素。将结果不断累加。

3. 参考代码

class Solution {
public:
    int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
        size_t len = grid.size();
        vector<int> rowSkylineVect;
        vector<int> colSkylineVect;
        int sum = 0;
        int i = 0, j = 0;
        
        for (i = 0; i < len; i++)
        {
            vector<int> tmpRow = grid[i];
            sort(tmpRow.begin(), tmpRow.end());
            int maxRowNum = tmpRow[len -1];
            rowSkylineVect.push_back(maxRowNum);
        }
        
        for (i = 0; i < len; i++)
        {
            vector<int> tmpCol;
            for (j = 0; j < len; j++)
            {
                tmpCol.push_back(grid[j][i]);
            }
            sort(tmpCol.begin(), tmpCol.end());
            int maxColNum = tmpCol[len - 1];
            colSkylineVect.push_back(maxColNum);
        }
        
        for (i = 0; i < len; i++)
        {
            for (j = 0; j < len; j++)
            {
                sum += min(colSkylineVect[i], rowSkylineVect[j]) - grid[i][j];
            }
        }
        
        return sum;
    }
};