思路:各行列的最大值(vector的最大值,函数max_element()),再加上占地个数
用时最短的方法巧妙一点,在遍历的时候直接两两比大小得到最大值
class Solution {
public:
int projectionArea(vector<vector<int>>& grid) {
int result = 0;//一开始初始化时没赋值为0,造成不断叠加(定义时要初始化)
int row = grid.size();
int col = grid[0].size();
vector<int> row_max, col_max;
vector<vector<int>> grid_trans(col, vector<int>(row));
for(int i = 0; i < row; i++)
{
auto max_position = max_element(grid[i].begin(), grid[i].end());
row_max.push_back(*max_position);
for(int j = 0; j < col; j++)
{
if(grid[i][j] != 0)
result += 1;
grid_trans[j][i] = grid[i][j];
}
}
//return result;
for(int i = 0; i < col; i++)
{
auto max_position1 = max_element(grid_trans[i].begin(), grid_trans[i].end());
col_max.push_back(*max_position1);
}
//result = 0;
for(auto c:row_max)
result += c;
for(auto c:col_max)
result += c;
return result;
}
};