LeetCode/2090. K Radius Subarray Averages.cpp at main · ChSatyaSavith/LeetCode · GitHub

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
class Solution {
public:
    vector<long long int> prefixSum;

    void createArr(vector<int> nums)
    {
        prefixSum.push_back(nums[0]);
        for(int i = 1;i<nums.size();i++)
        {
            long long int temp = nums[i]+prefixSum[i-1];
            prefixSum.push_back(temp);
        }
    } //ye to shi hai
    vector<int> getAverages(vector<int>& nums, int k)
    {
        createArr(nums);
        vector<int> toreturn;

        for(int i = 0;i<nums.size();i++)
        {
            int left = i-k;
            int right = i+k;
            if(left<0 || right>nums.size()-1)
            {
                toreturn.push_back(-1);
            }
            else
            {
                if(left==0)
                {
                    toreturn.push_back(prefixSum[right]/(2*k+1));
                }
                else if(left!=0)
                {
                    toreturn.push_back((prefixSum[right]-prefixSum[left-1])/(2*k+1));
                }
            }
        }
        return toreturn;

    }
};