leetcode 661

此题简单，思路是在原矩阵外边围一层-1，避免了边界判断的麻烦，然后再遍历即可。做的过程中犯了一些低级错误emmm。

class Solution {
public:
    vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
        vector<vector<int>> result;
        if(M.empty())
            return result;
        int r=M.size();
        int c=M[0].size();
        vector<vector<int>> temp;
        for(int i=0;i<r+2;i++){
            if(i==0||i==r+1){
                vector<int> t(c+2,-1);
                temp.push_back(t);
            }else{
                vector<int> t;
                for(int j=0;j<c+2;j++){
                    if(j==0||j==c+1)
                        t.push_back(-1);
                    else
                        t.push_back(M[i-1][j-1]);
                }
                temp.push_back(t);
            }
        }
        for(int i=1;i<r+1;i++){
            for(int j=1;j<c+1;j++){
                int front[3]={i-1,i,i+1};
                int behind[3]={j-1,j,j+1};
                int sum=0;
                int count=0;
                for(int m=0;m<3;m++){
                    for(int n=0;n<3;n++){
                        int value=temp[front[m]][behind[n]];
                        if(value!=-1){
                            sum+=value;
                            count++;
                        }
                    }
                }
                M[i-1][j-1]=sum/count;
            }
        }
        return M;
    }
};