遍历一遍数组即可:
class Solution {
public:
vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
vector<vector<int>> res;
for(int i=0;i<M.size();i++)
{
vector<int> temp;
for(int j=0;j<M[i].size();j++)
{
int count=1,sum=M[i][j];
if(j-1>=0)
{
count++;
sum+=M[i][j-1];
}
if(j+1<M[i].size())
{
count++;
sum+=M[i][j+1];
}
if(i-1>=0)
{
count++;
sum+=M[i-1][j];
if(j-1>=0)
{
count++;
sum+=M[i-1][j-1];
}
if(j+1<M[i].size())
{
count++;
sum+=M[i-1][j+1];
}
}
if(i+1<M.size())
{
count++;
sum+=M[i+1][j];
if(j-1>=0)
{
count++;
sum+=M[i+1][j-1];
}
if(j+1<M[i].size())
{
count++;
sum+=M[i+1][j+1];
}
}
temp.push_back(sum/count);
}
res.push_back(temp);
}
return res;
}
};