|
1 | 1 | #include <bits/stdc++.h> |
2 | 2 | using namespace std; |
3 | 3 |
|
4 | | -class Solution |
5 | | -{ |
| 4 | +class Solution { |
6 | 5 | public: |
7 | | - // TC: O(n square) |
8 | | - double bruteForceSol(vector<int> &nums, int &k) |
9 | | - { |
| 6 | + // TC: O(n^2) |
| 7 | + double bruteForceSol(vector<int>& nums, int& k) { |
10 | 8 | int maxSum = INT_MIN; |
11 | 9 | int i = 0, j = k - 1; |
12 | | - while (j < nums.size()) |
13 | | - { |
| 10 | + while (j < nums.size()) { |
14 | 11 | int sum = 0; |
15 | | - for (int y = i; y <= j; y++) |
16 | | - { |
17 | | - sum += nums[y]; |
18 | | - } |
| 12 | + sum = accumulate(nums.begin() + i, nums.begin() + j + 1, 0); |
19 | 13 | maxSum = max(maxSum, sum); |
20 | 14 | i++, j++; |
21 | 15 | } |
22 | | - double maxAvg = maxSum / (double)k; |
23 | | - return maxAvg; |
| 16 | + |
| 17 | + return maxSum / (double)k; |
24 | 18 | } |
25 | 19 |
|
26 | 20 | // TC: O(n) |
27 | | - double slidingWindowSol(vector<int> &nums, int &k) |
28 | | - { |
| 21 | + double slidingWindowSol(vector<int>& nums, int& k) { |
29 | 22 | int i = 0, j = k - 1; |
30 | | - int sum = 0; |
31 | | - for (int y = i; y <= j; ++y) |
32 | | - { |
33 | | - sum += nums[y]; |
34 | | - } |
| 23 | + int sum = accumulate(nums.begin() + i, nums.begin() + j + 1, 0); |
| 24 | + |
35 | 25 | int maxSum = sum; |
36 | | - j++; |
37 | | - while(j < nums.size()) |
38 | | - { |
| 26 | + while (j < nums.size()) { |
| 27 | + if(j + 1 == nums.size()) |
| 28 | + break; |
39 | 29 | sum -= nums[i++]; |
40 | | - sum += nums[j++]; |
| 30 | + sum += nums[++j]; |
41 | 31 | maxSum = max(maxSum, sum); |
42 | 32 | } |
43 | 33 |
|
44 | | - double maxAvg = maxSum / (double)k; |
45 | | - return maxAvg; |
| 34 | + return maxSum / (double)k; |
46 | 35 | } |
47 | 36 |
|
48 | | - double findMaxAverage(vector<int> &nums, int k) |
49 | | - { |
| 37 | + double findMaxAverage(vector<int>& nums, int k) { |
| 38 | + // return bruteForceSol(nums, k); |
50 | 39 | return slidingWindowSol(nums, k); |
51 | 40 | } |
52 | 41 | }; |
|
0 commit comments