Leetcode#661. Image Smoother

题目

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

Note:

The value in the given matrix is in the range of [0, 255].
The length and width of the given matrix are in the range of [1, 150].

题意

一个位置的数 = 它八个方向连同自己的平均数（向下取整）

题解

C++代码

class Solution {
public:
    vector<vector<int>> imageSmoother(vector<vector<int>>& M) {

        int dir[9][2] = {{-1,1},{-1,0},{-1,-1},{0,1},{0,-1},{1,1},{1,0},{1,-1}};
        int r, c , n=0;
        int sum = 0;
        if(M.size()==1 && M[0].size()==1){
            return M;
        }
        vector<vector<int>>res;
        vector<int>temp;
        for(int i=0; i<M.size(); i++){
            for(int j=0; j<M[0].size(); j++)
            {
                sum = M[i][j];
                n = 1;
                for(int k=0; k<8; k++){
                    r = i + dir[k][0];
                    c = j + dir[k][1];
                    if(r>=0 && r<M.size() && c>=0 && c<M[0].size()){
                        sum+=M[r][c];
                        n++;
                    }
                }
                temp.push_back(sum/n);
            }
            res.push_back(temp);
            temp.clear();
        }
        return res;
    }
};

python代码

class Solution(object):
    def imageSmoother(self, M):
        """
        :type M: List[List[int]]
        :rtype: List[List[int]]
        """
        dir = [[-1,1],[-1,0],[-1,-1],[0,1],[0,-1],[1,1],[1,0],[1,-1]] 
        r = 0
        c = 0
        n=0;
        sum = 0
        res = []
        temp = []
        for i in range(0, len(M)):
            for j in range(0, len(M[0])):
                sum = M[i][j]
                n = 1
                for k in range(0, 8):
                    r = i + dir[k][0];
                    c = j + dir[k][1];
                    if r>=0 and r<len(M) and c>=0 and c<len(M[0]):
                        sum = sum + M[r][c];
                        n = n + 1
                temp.append(sum/n)
            res.append(temp)
            temp = []

        return res