-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_661.js
97 lines (93 loc) · 2.13 KB
/
_661.js
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
/**
*
* 暴力法
* 时间复杂度O(mn)
* 空间复杂度O(mn)
*
* @param {number[][]} M
* @return {number[][]}
*/
var imageSmoother = function(M) {
let m = M.length
let n = M[0].length
const res = new Array(m)
for (let i = 0; i < res.length; i++) {
res[i] = new Array(n)
}
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
let count = 0
let sum = 0
for (let ni = i - 1; ni <= i + 1; ni++) {
for (let nj = j - 1; nj <= j + 1; nj++) {
if (0 <= ni && ni < m && 0 <= nj && nj < n) {
sum += M[ni][nj]
count++
}
}
}
res[i][j] = Math.floor(sum / count)
}
}
return res
};
/**
*
* 暴力法
* 时间复杂度O(mn)
* 空间复杂度O(mn)
*
* @param {number[][]} M
* @return {number[][]}
*/
var imageSmoother = function(M) {
let m = M.length
let n = M[0].length
const res = new Array(m)
for (let i = 0; i < res.length; i++) {
res[i] = new Array(n)
}
for (let i = 0; i < m; i++) {
for (let j = 0; j < n; j++) {
let sum = M[i][j]
let count = 1
// 上一行
if (i - 1 >= 0) {
sum += M[i - 1][j]
count++
if (j - 1 >= 0) {
sum += M[i - 1][j - 1]
count++
}
if (j + 1 < n) {
sum += M[i - 1][j + 1]
count++
}
}
// 同一行
if (j - 1 >= 0) {
sum += M[i][j - 1]
count++
}
if (j + 1 < n) {
sum += M[i][j + 1]
count++
}
// 下一行
if (i + 1 < m) {
sum += M[i + 1][j]
count++
if (j - 1 >= 0) {
sum += M[i + 1][j - 1]
count++
}
if (j + 1 < n) {
sum += M[i + 1][j + 1]
count++
}
}
res[i][j] = Math.floor(sum / count)
}
}
return res
};