mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-16 23:16:26 +00:00
51 lines
1.5 KiB
Plaintext
51 lines
1.5 KiB
Plaintext
---
|
|
title: '2090. K Radius Subarray Averages'
|
|
description: You are given a 0-indexed array nums of n integers, and an integer k
|
|
sidebar:
|
|
label: 'K Radius Subarray Averages'
|
|
badge: 'Medium'
|
|
---
|
|
|
|
<Badge variant="accent">Array</Badge>
|
|
|
|
### Example 1:
|
|
- Input: `nums = [7,4,3,9,1,8,5,2,6], k = 3`
|
|
- Output: `[-1,-1,-1,5,4,4,-1,-1,-1]`
|
|
- Explanation:
|
|
- `avg[0]`, `avg[1]`, and `avg[2]` are `-1` because there are less than `k` elements before each index.
|
|
- The sum of the subarray centered at index `3` with radius `3` is: `7 + 4 + 3 + 9 + 1 + 8 + 5 = 37`. Using integer division, `avg[3] = 37 / 7 = 5`.
|
|
- For the subarray centered at index `4`, `avg[4] = (4 + 3 + 9 + 1 + 8 + 5 + 2) / 7 = 4`.
|
|
- For the subarray centered at index `5`, `avg[5] = (3 + 9 + 1 + 8 + 5 + 2 + 6) / 7 = 4`.
|
|
- `avg[6]`, `avg[7]`, and `avg[8]` are `-1` because there are less than `k` elements after each index.
|
|
|
|
### Example 2:
|
|
- Input: `nums = [100000], k = 0`
|
|
- Output: `[100000]`
|
|
- Explanation:
|
|
- The sum of the subarray centered at index `0` with radius `0` is: `100000`. `avg[0] = 100000 / 1 = 100000`.
|
|
|
|
### Example 3:
|
|
- Input: `nums = [8], k = 100000`
|
|
- Output: `[-1]`
|
|
- Explanation:
|
|
- `avg[0]` is `-1` because there are less than `k` elements before and after index `0`.
|
|
|
|
### Constraints:
|
|
|
|
- `n == nums.length`
|
|
- `1 <= n <= 10^5`
|
|
- `0 <= nums[i], k <= 10^5`
|
|
|
|
## Solution
|
|
|
|
```js
|
|
/**
|
|
* @param {number[]} nums
|
|
* @param {number} k
|
|
* @return {number[]}
|
|
*/
|
|
var getAverages = function(nums, k) {
|
|
|
|
};
|
|
```
|