LeetCode(easy)-883.Projection Area of 3D Shapes

883.Projection Area of 3D Shapes
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
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网格上，我们放置了一些与x，y和z轴轴对齐的1 * 1 * 1立方体。每个值v = grid [i] [j]表示放置在网格单元（i，j）顶部的立方体塔。现在我们查看这些立方体在xy，yz和zx平面上的投影。投影就像阴影，将我们的三维图形映射到二维平面。在这里，我们从顶部，正面和侧面观察立方体时正在查看“阴影”。返回所有三个投影的总面积。
解法一：

//根据图示及样例输入输出，然后找到相应的关系再进行编码。
int projectionArea(int** grid, int gridRowSize, int *gridColSizes) {
	int x=0;
	int y=0;
	int z=0;
	for(int i=0;i<gridRowSize;i++){
		int max1=0;
        int max2=0;    //用完后及时清零 
		for(int j=0;j<gridRowSize;j++){
			//顶面 
			if(grid[i][j]!=0){
				x = x + 1;
			}
			//侧面
			if(grid[i][j]>=max1){
				max1 = grid[i][j];
			}
			//正面
			if(grid[j][i]>=max2){
				max2 = grid[j][i];
			}
		}
        y += max1;       
        z += max2; 
	}
	return x+y+z;
}

Runtime: 4 ms