leetcode Weekly Contest 77 807. Max Increase to Keep City Skyline

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

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

What is the maximum total sum that the height of thebuildings 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 withoutaffecting 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.

这一题简单来说就是给你一个矩阵，问你保证这个矩阵每一行，每一列的最大值都不变的情况下，最多可以将这个矩阵里面的所有值增加多少

首先统计每一行，每一列的最大值，然后将这个值减去每一行，每一列的值之后相加，就是最终的结果

这一题需要注意一下，从上到下遍历的时候需要怎么做

class Solution {
public:
int maxIncreaseKeepingSkyline(vector<vector<int> >& grid) {
   int theMaxHRows[53] = {
   	0
   }; 
   int theMaxHCols[53] = {
   	0
   }; 
   int rows=grid.size(); int cols = grid[0].size();
   for(int i=0;i<rows;i++)
   for(int j=0;j<cols;j++)
   if(grid[i][j]>theMaxHRows[i])
   theMaxHRows[i] = grid[i][j];
   
   for(int i=0;i<cols;i++)
   for(int j=0;j<rows;j++)
   if(grid[j][i]>theMaxHCols[i])
   theMaxHCols[i] = grid[j][i];
   
   int theCount=0;
   
   for(int i=0;i<rows;i++)
   for(int j=0;j<cols;j++)
   {
   	theCount+=(min(theMaxHCols[j],theMaxHRows[i])-grid[i][j]);
   }
   return theCount;
}
};