在 N * N
的网格上,我们放置一些 1 * 1 * 1
的立方体。
每个值 v = grid[i][j]
表示 v
个正方体叠放在单元格 (i, j)
上。
返回结果形体的总表面积。
示例 1:
输入:[[2]]
输出:10
示例 2:
输入:[[1,2],[3,4]]
输出:34
示例 3:
输入:[[1,0],[0,2]]
输出:16
示例 4:
输入:[[1,1,1],[1,0,1],[1,1,1]]
输出:32
示例 5:
输入:[[2,2,2],[2,1,2],[2,2,2]]
输出:46
提示:
1 <= N <= 50
0 <= grid[i][j] <= 50
C
int surfaceArea(int** grid, int gridRowSize, int *gridColSizes)
{
int res=0;
int m=gridRowSize;
int n=*gridColSizes;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(grid[i][j]>0)
{
res+=4*grid[i][j]+2;
if(i-1>=0)
{
res-=grid[i-1][j]<grid[i][j]?grid[i-1][j]:grid[i][j];
}
if(i+1<m)
{
res-=grid[i+1][j]<grid[i][j]?grid[i+1][j]:grid[i][j];
}
if(j-1>=0)
{
res-=grid[i][j-1]<grid[i][j]?grid[i][j-1]:grid[i][j];
}
if(j+1<n)
{
res-=grid[i][j+1]<grid[i][j]?grid[i][j+1]:grid[i][j];
}
}
}
}
return res;
}
C++
class Solution {
public:
int surfaceArea(vector<vector<int>>& grid)
{
int res=0;
int m=grid.size();
int n=grid[0].size();
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
if(grid[i][j]>0)
{
res+=4*grid[i][j]+2;
if(i-1>=0)
{
res-=min(grid[i-1][j],grid[i][j]);
}
if(i+1<m)
{
res-=min(grid[i+1][j],grid[i][j]);
}
if(j-1>=0)
{
res-=min(grid[i][j-1],grid[i][j]);
}
if(j+1<n)
{
res-=min(grid[i][j+1],grid[i][j]);
}
}
}
}
return res;
}
};
python
class Solution:
def surfaceArea(self, grid):
"""
:type grid: List[List[int]]
:rtype: int
"""
n=len(grid)
res=0
for i in range(n):
for j in range(n):
if grid[i][j]>0:
res+=4*grid[i][j]+2
if i-1>=0:
res-=min(grid[i][j],grid[i-1][j])
if i+1<n:
res-=min(grid[i][j],grid[i+1][j])
if j-1>=0:
res-=min(grid[i][j],grid[i][j-1])
if j+1<n:
res-=min(grid[i][j],grid[i][j+1])
return res