Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the average gray scale (rounding down) of all the 8 surrounding cells and itself. If a cell has less than 8 surrounding cells, then use as many as you can.
Example 1:
Input:
[[1,1,1],
[1,0,1],
[1,1,1]]
Output:
[[0, 0, 0],
[0, 0, 0],
[0, 0, 0]]
Explanation:
For the point (0,0), (0,2), (2,0), (2,2): floor(3/4) = floor(0.75) = 0
For the point (0,1), (1,0), (1,2), (2,1): floor(5/6) = floor(0.83333333) = 0
For the point (1,1): floor(8/9) = floor(0.88888889) = 0
一个2D数组数据,用来做图像灰度处理的。处理的过程就是将当前位置上的元素以及周围相联的元素上的元素相加,比如[0][0],周围坐标是[0][1]、[1][0]、[1][1],相加得到3,然后除以总个数:3/4=0.75=0。也就是说如果某个元素周围并不是全部都为1的话,那么这个位置上就要被重置为0。
可以遍历数组中的全部元素,然后再分别计算相邻的元素之和,最后除以个数即可。遍历的时候只需要遍历当前行和上下行即可,列也是如此,同时需要注意不能索引溢出即可。
class Solution {
public:
vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
int r = M.size();// 计算出行数
int c = M[0].size();// 计算出列数
int count = 0;// 用来统计每个数字周围的个数
vector<vector<int>> ans(r,vector<int>(c));//用来保存结果
for(int i=0; i < r; i++) {
for(int j=0; j < c; j++) {
count = 0;
for(int r1=i-1;r1<=i+1;r1++) {//遍历前后两行
for(int c1=j-1;c1<=j+1;c1++) {//遍历前后两列
if(0<=r1 && r1 <r && 0<=c1 && c1<c) {//如果在指定范围内的话。
ans[i][j] += M[r1][c1];// 将其进行相加
count++;
}
}
}
//cout << ans[i][j] << "," << count << endl;
ans[i][j] /= count;//计算出结果
}
}
return ans;
}
};