-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
46 lines (42 loc) · 1.47 KB
/
Solution.java
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
class Solution {
public int[][] imageSmoother(int[][] M) {
if (M.length == 0) return M;
int[][] res = new int[M.length][M[0].length];
for (int i = 0; i < M.length; i++) {
for (int j = 0; j < M[0].length; j++) {
List<Integer> points = new ArrayList<Integer>();
points.add(M[i][j]);
if (j >= 1) {
points.add(M[i][j - 1]);
}
if (j + 1 < M[0].length) {
points.add(M[i][j + 1]);
}
if (i >= 1) {
points.add(M[i - 1][j]);
if (j >= 1) {
points.add(M[i - 1][j - 1]);
}
if (j + 1 < M[0].length) {
points.add(M[i - 1][j + 1]);
}
}
if (i + 1 < M.length) {
points.add(M[i + 1][j]);
if (j >= 1) {
points.add(M[i + 1][j - 1]);
}
if (j + 1 < M[0].length) {
points.add(M[i + 1][j + 1]);
}
}
int pointsSum = 0;
for (int point : points) {
pointsSum += point;
}
res[i][j] = pointsSum / points.size();
}
}
return res;
}
}