[leetcode] 883. Projection Area of 3D Shapes

Description

On a N * N grid, we place some 1 * 1 * 1 cubes that are axis-aligned with the x, y, and z axes.

Each value v = grid[i][j] represents a tower of v cubes placed on top of grid cell (i, j).

Now we view the projection of these cubes onto the xy, yz, and zx planes.

A projection is like a shadow, that maps our 3 dimensional figure to a 2 dimensional plane.

Here, we are viewing the “shadow” when looking at the cubes from the top, the front, and the side.

Return the total area of all three projections.

Example 1:

Input: [[2]]
Output: 5

Example 2:

Input: [[1,2],[3,4]]
Output: 17
Explanation: 
Here are the three projections ("shadows") of the shape made with each axis-aligned plane.

Example 3:

Input: [[1,0],[0,2]]
Output: 8

Example 4:

Input: [[1,1,1],[1,0,1],[1,1,1]]
Output: 14

Example 5:

Input: [[2,2,2],[2,1,2],[2,2,2]]
Output: 21

Note:

  • 1 <= grid.length = grid[0].length <= 50
  • 0 <= grid[i][j] <= 50

分析

题目的意思是:给定一个N*N的网格,网格里面的数代表三维坐标下的z,网格的行和列代表x,y。求主视图,左视图,俯视图的面积。

  • 这道题的俯视图很简单,就是N*N的网格中有数的格子数。
  • 左视图是网格中每一行遍历的最大值
  • 主石图是网格中每一列遍历的最大值

如果知道这些就好办了,写两个循环遍历一下就知道了。

代码

class Solution:
    def projectionArea(self, grid: List[List[int]]) -> int:
        res=0
        N=len(grid)
        for i in range(N):
            max_col=0
            max_row=0
            for j in range(N):
                if(grid[i][j]):
                    res+=1
                max_row=max(max_row,grid[i][j])
                max_col=max(max_col,grid[j][i])
            res+=max_col+max_row
        return res

参考文献

solution

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

农民小飞侠

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值