643. Maximum Average Subarray I

Easy

2.3K

186

You are given an integer array `nums`

consisting of `n`

elements, and an integer `k`

.

Find a contiguous subarray whose **length is equal to** `k`

that has the maximum average value and return *this value*. Any answer with a calculation error less than `10`

will be accepted.^{-5}

**Example 1:**

Input:nums = [1,12,-5,-6,50,3], k = 4Output:12.75000Explanation:Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75

**Example 2:**

Input:nums = [5], k = 1Output:5.00000

**Constraints:**

`n == nums.length`

`1 <= k <= n <= 10`

^{5}`-10`

^{4}<= nums[i] <= 10^{4}

Accepted

200.3K

Submissions

458.4K

Acceptance Rate

43.7%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved