leetCode883

我好讨厌这种类型的题哦

class Solution {
public:
    int projectionArea(vector<vector<int>>& grid) {
        int ans = 0;
        int MaxJ = 0;
        for(int i = 0;i<grid.size();i++)
        {
            int Max = 0;
            MaxJ = MaxJ>grid[i].size()?MaxJ:grid[i].size();          
            for(int j = 0;j<grid[i].size();j++)
            {
                Max = max(Max,grid[i][j]);
                ans+=grid[i][j]>0?1:0;
            }
            ans+=Max;
        }
        for(int j = 0;j<MaxJ;j++)
        {
            int Max = 0;
            for(int i = 0;i<grid.size();i++)
            {
                if(grid[i].size()>=j+1)
                {
                    Max = max(Max,grid[i][j]);
                }
            }
            ans+=Max;
        }
        return ans;
    }
};