class Solution {
public int[][] imageSmoother(int[][] img) {
int m = img.length, n = img[0].length;
int[][] ret = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int num = 0, sum = 0;
for (int x = i - 1; x <= i + 1; x++) {
for (int y = j - 1; y <= j + 1; y++) {
if (x >= 0 && x < m && y >= 0 && y < n) {
num++;
sum += img[x][y];
}
}
}
ret[i][j] = sum / num;
}
}
return ret;
}
}
/**
* @param {number[][]} img
* @return {number[][]}
*/
var imageSmoother = function(img) {
const m = img.length, n = img[0].length;
const ret = new Array(m).fill(0).map(() => new Array(n).fill(0));
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
let num = 0, sum = 0;
for (let x = i - 1; x <= i + 1; x++) {
for (let y = j - 1; y <= j + 1; y++) {
if (x >= 0 && x < m && y >= 0 && y < n) {
num++;
sum += img[x][y];
}
}
}
ret[i][j] = Math.floor(sum / num);
}
}
return ret;
};
class Solution:
def imageSmoother(self, img: List[List[int]]) -> List[List[int]]:
m, n = len(img), len(img[0])
ans = [[0] * n for _ in range(m)]
for i in range(m):
for j in range(n):
tot, num = 0, 0
for x in range(max(i - 1, 0), min(i + 2, m)):
for y in range(max(j - 1, 0), min(j + 2, n)):
tot += img[x][y]
num += 1
ans[i][j] = tot // num
return ans
func imageSmoother(img [][]int) [][]int {
r, c := len(img), len(img[0])
ans := make([][]int, r)
for i := 0; i < r; i++ {
ans[i] = make([]int, c)
}
for i := 0; i < r; i++ {
for j := 0; j < c; j++ {
num, sum := 1, img[i][j]
if i > 0 && j > 0 { // 左上
sum += img[i-1][j-1]
num++
}
if i > 0{ // 正上
sum += img[i-1][j]
num++
}
if i > 0 && j < c-1 { // 右上
sum += img[i-1][j+1]
num++
}
if j > 0 { // 左
sum += img[i][j-1]
num++
}
if j < c-1 { // 右
sum += img[i][j+1]
num++
}
if i < r-1 && j > 0 { // 左下
sum += img[i+1][j-1]
num++
}
if i < r-1 { // 正下
sum += + img[i+1][j]
num++
}
if i < r-1 && j < c-1 { // 右下
sum += img[i+1][j+1]
num++
}
ans[i][j] = sum / num
}
}
return ans
}
