leetcode

0 class Solution {

1 public:

2 vector<int> getAverages(const vector<int> &nums, int k) {

3 int n = nums.size();

4 if (n <= 2 * k) return vector<int>(n, -1);

5

6 vector<int> res(n);

7 long long sum = 0;

8 for (int i = 0; i < k; i++) {

9 sum += nums[i] + nums[i + k];

10 res[i] = res[n - k + i] = -1;

11 }

12

13 for (int i = k; i < n - k; i++) {

14 sum += nums[i + k];

15 res[i] = sum / (2 * k + 1);

16 sum -= nums[i - k];

17 }

18

19 return res;

20 }

21 };