661. Image Smoother*

661. Image Smoother*

https://leetcode.com/problems/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++ 实现 1

class Solution {
private:
    int smoother(vector<vector<int>> &image, int i, int j) {
        int m = image.size(), n = image[0].size();
        int sum = 0, count = 0;
        for (auto &dx : {-1, 0, 1}) {
            for (auto &dy : {-1, 0, 1}) {
                int x = i + dx, y = j + dy;
                if (x >= 0 && x < m && y >= 0 && y < n) {
                    sum += image[x][y];
                    count ++;
                }
            }
        }
        return sum / count;
    }
public:
    vector<vector<int>> imageSmoother(vector<vector<int>>& M) {
        if (M.empty() || M[0].empty()) return {};
        vector<vector<int>> res(M);
        int m = M.size(), n = M[0].size();
        for (int i = 0; i < m; ++ i)
            for (int j = 0; j < n; ++ j)
                res[i][j] = smoother(M, i, j);
        return res;   
    }
};