Peak Window Average

EASY10 pts

You are provided with an integer array nums containing n elements and a positive integer k representing the window size.

Your task is to identify a contiguous subarray (also known as a window) of exactly k consecutive elements that yields the highest arithmetic mean among all possible windows of that size.

Return the maximum average value as a floating-point number.

Key Concepts:

A contiguous subarray consists of consecutive elements from the original array without gaps
The arithmetic mean (average) of a subarray is the sum of its elements divided by the count of elements
Multiple windows may exist in the array, and you must examine all of them to find the one with the highest average

Note: Any answer within 10⁻⁵ of the actual result will be considered correct due to floating-point precision considerations.

Example

Input

nums = [1,12,-5,-6,50,3]
k = 4

Output

12.75000

Explanation

The possible windows of size 4 are:

[1,12,-5,-6] with sum = 2 and average = 0.5
[12,-5,-6,50] with sum = 51 and average = 12.75
[-5,-6,50,3] with sum = 42 and average = 10.5

The window [12,-5,-6,50] has the maximum average of (12 + (-5) + (-6) + 50) / 4 = 51 / 4 = 12.75.

Example

Input

nums = [5]
k = 1

Output

5.00000

Explanation

There is only one element and one possible window of size 1. The average is simply 5 / 1 = 5.0.

Example

Input

nums = [0,1,2,3,4,5]
k = 3

Output

4.00000

Explanation

The possible windows of size 3 are:

[0,1,2] with average = 1.0
[1,2,3] with average = 2.0
[2,3,4] with average = 3.0
[3,4,5] with average = 4.0

The last window [3,4,5] yields the maximum average of 4.0.

Accepted0/0·0% Acceptance

Constraints

n == nums.length
1 ≤ k ≤ n ≤ 10⁵
-10⁴ ≤ nums[i] ≤ 10⁴

Code

Visualizer

Solutions

14px

Test Cases3

Results

Submissions

k =

nums =

[1,12,-5,-6,50,3]

Peak Window Average

Hints

Peak Window Average

Hints