Surface Area Of 3D Shapes Problem


Description

LeetCode Problem 892.

You are given an n x n grid where you have placed some 1 x 1 x 1 cubes. Each value v = grid[i][j] represents a tower of v cubes placed on top of cell (i, j).

After placing these cubes, you have decided to glue any directly adjacent cubes to each other, forming several irregular 3D shapes.

Return the total surface area of the resulting shapes.

Note: The bottom face of each shape counts toward its surface area.

Example 1:

1
2
Input: grid = [[2]]
Output: 10

Example 2:

1
2
Input: grid = [[1,2],[3,4]]
Output: 34

Example 3:

1
2
Input: grid = [[1,0],[0,2]]
Output: 16

Example 4:

1
2
Input: grid = [[1,1,1],[1,0,1],[1,1,1]]
Output: 32

Example 5:

1
2
Input: grid = [[2,2,2],[2,1,2],[2,2,2]]
Output: 46

Constraints:

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


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
class Solution {
public:
    int surfaceArea(vector<vector<int>>& grid) {
        int n = grid.size();
        int res = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (grid[i][j] == 0) continue;
                res += grid[i][j] * 6 - 2 * (grid[i][j] - 1); 
                if (i < n - 1) res -= 2 * min(grid[i][j], grid[i+1][j]);
                if (j < n - 1) res -= 2 * min(grid[i][j], grid[i][j+1]); 
            }
        }
        return res;
    }
};




Related Posts

Three Equal Parts Problem

LeetCode 927. You are given an array arr which consists...

Surface Area Of 3D Shapes Problem

LeetCode 892. You are given an n x n grid...

Super Palindromes Problem

LeetCode 906. Let’s say a positive integer is a super-palindrome...

Smallest Range I Problem

LeetCode 908. You are given an integer array nums and...

Projection Area Of 3D Shapes Problem

LeetCode 883. You are given an n x n grid...

Prime Palindrome Problem

LeetCode 866. Given an integer n, return the smallest prime...