Class Solution
-
- All Implemented Interfaces:
public final class Solution
643 - Maximum Average Subarray I.
Easy
You are given an integer array
nums
consisting ofn
elements, and an integerk
.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 <code>10<sup>-5</sup></code> will be accepted.Example 1:
Input: nums = 1,12,-5,-6,50,3, k = 4
Output: 12.75000
Explanation: Maximum average is (12 - 5 - 6 + 50) / 4 = 51 / 4 = 12.75
Example 2:
Input: nums = 5, k = 1
Output: 5.00000
Constraints:
n == nums.length
<code>1 <= k <= n <= 10<sup>5</sup></code>
<code>-10<sup>4</sup><= numsi<= 10<sup>4</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Double
findMaxAverage(IntArray nums, Integer k)
-
-
Method Detail
-
findMaxAverage
final Double findMaxAverage(IntArray nums, Integer k)
-
-
-
-