887. Projection Area of 3D Shapes

887. Projection Area of 3D Shapes

---

题目

Leetcode题目

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

---

解决

我们可以将三个投影面分开来算：

• top(xy投影面)
  这个投影面是最容易的。直接考虑在grid里面有几个不为零的数即为所求面积。
• front(xz投影面)
  grid数组中每一列最大值之和。
• side(yz投影面)
  grid数组中每一行最大值之和。

class Solution {
public:
    int projectionArea(vector<vector<int>>& grid) {
        int n = grid.size();
        int top = 0; // xy投影面
        int front = 0; // xz投影面
        int side = 0; // yz投影面
        for (int i = 0; i < n; i++) {
            int x = 0;
            int y = 0;
            for (int j = 0; j < n; j++) {
                if (grid[i][j]) top++;
                x = max(x, grid[i][j]);
                y = max(y, grid[j][i]);
            }
            front += x;
            side += y;
        }
        return (top + front + side);
    }
};