计算每个点周围1的个数 Image Smoother

为什么80%的码农都做不了架构师？>>>   

问题：

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:

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

解决：

【题意】计算每个点的上、下、左、右、左上、左下、右上、右下8个位置的1的个数，并且求其所占的比例，将该位置上的数更新为所得比例的取整。

①  直接计算。

class Solution { //35ms
    public int[][] imageSmoother(int[][] M) {
        int m = M.length;
        int n = M[0].length;
        int[][] res = new int[m][n];
        int[][] dirs = {{0,1},{0,-1},{1,0},{-1,0},{1,1},{-1,-1},{1,-1},{-1,1}};
        for (int i = 0; i < m;i ++){
            for (int j = 0;j < n;j ++){
                int count = 1;
                res[i][j] += M[i][j];
                for (int k = 0;k < 8;k ++){
                    int x = i + dirs[k][0];
                    int y = j + dirs[k][1];
                    if (x < 0 || y < 0 || x >= m || y >= n){
                        continue;
                    }
                    count ++;
                    res[i][j] += M[x][y];
                }
                res[i][j] /= count;
            }
        }
        return res;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1606472