-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathimageSmoother.go
More file actions
48 lines (44 loc) · 1.36 KB
/
Copy pathimageSmoother.go
File metadata and controls
48 lines (44 loc) · 1.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
/* https://leetcode.com/problems/image-smoother/description/
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].
*/
package larray
func imageSmoother(M [][]int) [][]int {
colLen, rowLen := len(M), len(M[0])
res := make([][]int, colLen)
for row := range res {
res[row] = make([]int, rowLen, rowLen)
for col := range res[row] {
sum, count := 0, 0
for i := row - 1; i < row+2; i++ {
if i < 0 || i >= colLen {
continue
}
for j := col - 1; j < col+2; j++ {
if j < 0 || j >= rowLen {
continue
}
sum += M[i][j]
count++
}
}
res[row][col] = int(sum / count)
}
}
return res
}