Maximum Average Subarray I LeetCode solution in Python

1
//O(N) Time and O(1) Space - SLIDING WINDOW
2

3
class Solution {
4
public:
5
    double findMaxAverage(vector<int>& nums, int k) {
6

7
        double ans = INT_MIN;
8

9
        int i = 0;
10
        int j = 0;
11
        int sum = 0;
12

13
        while(j<nums.size()){
14

15
            //calcs
16
            sum = sum+nums[j];
17

18
            if(j-i+1 < k){
19
                j++;
20
            }
21
            else if(j-i+1 == k){
22

23
                //ans
24
                double nos =  k*1.0;
25
                ans = max(ans, sum/nos);
26

27

28
                int v = nums[i];
29
                sum = sum - v;
30

31
                //SLIDE
32
                i++;
33
                j++;
34
            }
35
        }
36

37
        return ans;
38

39

40
    }
41
};