class Solution {
public:
int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
int N = grid.size();
int M = grid[0].size();
int maxN[N];
int maxM[M];
memset(maxN,0,sizeof(maxN));
memset(maxM,0,sizeof(maxM));
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
maxN[i] = max(maxN[i],grid[i][j]);
maxM[j] = max(maxM[j],grid[i][j]);
}
}
int ans = 0;
for(int i=0;i<N;i++){
for(int j=0;j<M;j++){
ans += max(0,min(maxN[i],maxM[j]) - grid[i][j]);
}
}
return ans;
}
};
No.81 - LeetCode807
最新推荐文章于 2024-03-01 21:14:29 发布