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].

分析：

将二维数组中的某一个值和周围的值相加得到平均值。其中四条边是特殊情况，需要单独处理。

具体代码如下：

public class ImageSmoother661 {

    private static final int[] offset = new int[]{-1, 0, 1};

    public int[][] imageSmoother(int[][] M) {

        if (M == null || M.length == 0) {
            return null;
        }

        int height = M.length;
        int width = M[0].length;
        int[][] result = new int[height][width];//创建一个对象的结果
        for (int h = 0; h < height; h++) {//每一行
            for (int w = 0; w < width; w++) {//每一列
                int sum = 0;
                int count = 0;
                for (int wOffset : offset) {//横坐标偏移量
                    for (int hOffset : offset) {//总坐标偏移量
                        if (isLegal((h + hOffset), (w + wOffset), height, width)) {
                            count++;
                            sum += M[h + hOffset][w + wOffset];
                        }
                    }
                }
                result[h][w] = sum / count;
            }
        }
        return result;
    }


    /**
     * 判断当前坐标是否需要计算
     *
     * @param hIndex 高度
     * @param wIndex 宽度
     * @param height 坐标的高度
     * @param width  坐标的宽度
     * @return
     */
    private boolean isLegal(int hIndex, int wIndex, int height, int width) {
        if (hIndex < 0 || wIndex < 0 || hIndex >= height || wIndex >= width) {
            return false;
        }
        return true;
    }
}

其中对于四条边的处理，通过isLegal将四条边界来过滤掉。这样会让代码简洁，会添加一些额外的计算复杂度。

另外一种方式是将四条边和内部的数据进行单独的处理。