题目描述
给定一个
m x n
的矩阵,其中的值均为正整数,代表二维高度图每个单元的高度,请计算图中形状最多能接多少体积的雨水。
说明
m 和 n 都是小于110的整数。每一个单位的高度都大于 0 且小于 20000。
示例
给出如下 3x6 的高度图: [ [1,4,3,1,3,2], [3,2,1,3,2,4], [2,3,3,2,3,1] ] 返回 4。
思路
和接雨水简单版一样,从二维到三维,每一个点找到前后左右四个方向最高的柱子,简单的示例通过,有些复杂示例有些偏差。
实现
int trapRainWater(vector<vector<int>>& heightMap) {
int height = heightMap.size();
if (height <= 1)
{
return -1;
}
int width = heightMap[0].size();
if (width <= 1)
{
return -1;
}
vector<vector<int>> up(height, vector<int>(width)), down(height, vector<int>(width));
vector<vector<int>> left(height, vector<int>(width)), right(height, vector<int>(width));
for (int i = 1; i < height; i++)
{
for (int j = 0; j < width; j++)
{
up[i][j] = max(heightMap[i - 1][j], up[i - 1][j]);
}
}
for (int i = height - 2; i >= 0; i--)
{
for (int j = 0; j < width; j++)
{
down[i][j] = max(heightMap[i + 1][j], down[i + 1][j]);
}
}
for (int i = 0; i < height; i++)
{
for (int j = 1; j < width; j++)
{
left[i][j] = max(left[i][j - 1], heightMap[i][j - 1]);
}
}
for (int i = 0; i < height; i++)
{
for (int j = width - 2; j >= 0; j--)
{
right[i][j] = max(right[i][j + 1], heightMap[i][j + 1]);
}
}
int water = 0;
for (int i = 0; i < height; i++)
{
for (int j = 0; j < width; j++)
{
int level = min(min(up[i][j], down[i][j]), min(left[i][j], right[i][j]));
water += max(0, level - heightMap[i][j]);
}
}
return water;
}