leetCode661

卷积核计算

class Solution {
public:
    vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
        vector<vector<int>>ans;
        int dx[8] = {-1,-1,-1,0,1,1,1,0};
        int dy[8] = {-1,0,1,1,1,0,-1,-1};
        for(int i = 0;i<M.size();i++)
        {
            vector<int>tmp;
            for(int j = 0;j<M[i].size();j++)
            {
                double sum = M[i][j];
                int count = 1;
                
                for(int k = 0;k<8;k++)
                {
                    if(i+dx[k]>=0 && i+dx[k]<M.size() && j+dy[k]>=0 && j+dy[k] <M[0].size())
                    {
                        sum+=M[i+dx[k]][j+dy[k]];
                        count++;
                    } 
                }
                tmp.push_back(sum/count);       
                
            }
            ans.push_back(tmp);
        }
        return ans;
    }
                                                     
};