-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_643.js
47 lines (46 loc) · 916 Bytes
/
_643.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
/**
*
* 求和
* 时间复杂度O(n)
* 空间复杂度O(n)
*
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var findMaxAverage = function(nums, k) {
const n = nums.length
const sumArr = new Array(n).fill(0)
sumArr[0] = nums[0]
for (let i = 1; i < n; i++) {
sumArr[i] = sumArr[i - 1] + nums[i]
}
let res = sumArr[k - 1] / k
for (let i = k; i < n; i++) {
res = Math.max(res, (sumArr[i] - sumArr[i - k]) / k)
}
return res
};
/**
*
* 滑动窗口
* 时间复杂度O(n)
* 空间复杂度O(1)
*
* @param {number[]} nums
* @param {number} k
* @return {number}
*/
var findMaxAverage = function(nums, k) {
const n = nums.length
let sum = 0
for (let i = 0; i < k; i++) {
sum += nums[i]
}
let maxVal = sum
for (let i = k; i < n; i++) {
sum = sum + nums[i] - nums[i - k]
maxVal = Math.max(maxVal, sum)
}
return maxVal / k
};