892. Surface Area of 3D Shapes
题目
On a N * N
grid, we place some 1 * 1 * 1
cubes.
Each value v = grid[i][j]
represents a tower of v cubes placed on top of grid cell (i, j)
.
Return the total surface area of the resulting shapes.
Example 1:
Input: [[2]]
Output: 10
Example 2:
Input: [[1,2],[3,4]]
Output: 34
Example 3:
Input: [[1,0],[0,2]]
Output: 16
Example 4:
Input: [[1,1,1],[1,0,1],[1,1,1]]
Output: 32
Example 5:
Input: [[2,2,2],[2,1,2],[2,2,2]]
Output: 46
Note:
1 <= N <= 50
0 <= grid[i][j] <= 50
解决
所求表面积 = 6(每个立方体的表面积) * 立方体个数 - 隐藏的立方体的面的总面积
grid
大小为n * n
。
- 时间复杂度:O(n * n)
- 空间复杂度:O(1)
class Solution {
public:
int surfaceArea(vector<vector<int>>& grid) {
int result = 0;
int n = grid.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (!grid[i][j]) continue;
result += grid[i][j] * 4 + 2;
if (i - 1 >= 0) result -= min(grid[i - 1][j], grid[i][j]) * 2;
if (j - 1 >= 0) result -= min(grid[i][j - 1], grid[i][j]) * 2;
}
}
return result;
}
};