-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path643.maximum-average-subarray-i.cpp
More file actions
45 lines (43 loc) · 1.08 KB
/
643.maximum-average-subarray-i.cpp
File metadata and controls
45 lines (43 loc) · 1.08 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
// Tag: Array, Sliding Window
// Time: O(N)
// Space: O(1)
// Ref: -
// Note: -
// You are given an integer array nums consisting of n elements, and an integer k.
// Find a contiguous subarray whose length is equal to k that has the maximum average value and return this value. Any answer with a calculation error less than 10-5 will be accepted.
//
// Example 1:
//
// Input: nums = [1,12,-5,-6,50,3], k = 4
// Output: 12.75000
// Explanation: Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75
//
// Example 2:
//
// Input: nums = [5], k = 1
// Output: 5.00000
//
//
// Constraints:
//
// n == nums.length
// 1 <= k <= n <= 105
// -104 <= nums[i] <= 104
//
//
class Solution {
public:
double findMaxAverage(vector<int>& nums, int k) {
int n = nums.size();
int tmp = 0;
int res = INT_MIN;
for (int i = 0; i < n; i++) {
tmp += nums[i];
if (i >= k - 1) {
res = max(res, tmp);
tmp -= nums[i - k + 1];
}
}
return double(res) / k;
}
};