Easy
Quiz
#643 Maximum Average Subarray I
APPROACH
Given an integer array nums and an integer k, find the contiguous subarray of exactly k elements with the highest average and return that average value. Answers within 10-5 of the correct result are 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
1 of 4
1:00
What is the optimal approach for this problem?