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:

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个格子和它自己 的和，然后取平均值，再赋值给这个格子。

格子中的数字也不仅仅只是0和1，比如下面的测试用例：

public int[][] imageSmoother(int[][] M) {
		if(M.length==0||M[0].length==0){
			return M;
		}		
		int m=M.length;
		int n=M[0].length;
		int[][] result=new int[m][n];
		for(int i=0;i<m;i++){
			for(int j=0;j<n;j++){
				int average=getAverage(M, i, j, m, n);
				result[i][j]=average;
			}
		}
		return result;
	}
	
	//把 它四周的8个元素的和 全算出来
	public int getAverage(int[][] M,int i,int j,int m,int n){
		int sum=0;
		sum+=M[i][j];
		int count=1;
		if(i-1>=0&&j-1>=0){
			sum+=M[i-1][j-1];
			count++;
		}
		if(i-1>=0){
			sum+=M[i-1][j];
			count++;
		}
		if(i-1>=0&&j+1<n){
			sum+=M[i-1][j+1];
			count++;
		}
		if(j-1>=0){
			sum+=M[i][j-1];
			count++;
		}
		if(j+1<n){
			sum+=M[i][j+1];
			count++;
		}
		if(i+1<m&&j-1>=0){
			sum+=M[i+1][j-1];
			count++;
		}
		if(i+1<m){
			sum+=M[i+1][j];
			count++;
		}
		if(i+1<m&&j+1<n){
			sum+=M[i+1][j+1];
			count++;
		}
		int result=(int)Math.floor((double)sum/count);
		return result;
	}

大神的解法看上去更简洁，其实想法是跟我一样的。(我这才发现原来 直接用 sum/count 就是 rounding down 四舍五入）

public class ImageSmoother {

    public int[][] imageSmoother(int[][] M) {
        if (M == null) return null;
        int rows = M.length;
        if (rows == 0) return new int[0][];
        int cols = M[0].length;

        int result[][] = new int[rows][cols];

        for (int row = 0; row < rows; row++) {
            for (int col = 0; col < cols; col++) {
                int count = 0;
                int sum = 0;
                for (int incR : new int[]{-1, 0, 1}) {
                    for (int incC : new int[]{-1, 0, 1}) {
                        if (isValid(row + incR, col + incC, rows, cols)) {
                            count++;
                            sum += M[row + incR][col + incC];
                        }
                    }
                }
                result[row][col] = sum / count;
            }
        }

        return result;

    }

    private boolean isValid(int x, int y, int rows, int cols) {
        return x >= 0 && x < rows && y >= 0 && y < cols;
    }
}