// DRUNKWATER TEMPLATE(add description and prototypes)
// Question Title and Description on leetcode.com
// Function Declaration and Function Prototypes on leetcode.com
//643. Maximum Average Subarray I
//Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.
//Example 1:
//Input: [1,12,-5,-6,50,3], k = 4
//Output: 12.75
//Explanation: Maximum average is (12-5-6+50)/4 = 51/4 = 12.75
//Note:
//1 <= k <= n <= 30,000.
//Elements of the given array will be in the range [-10,000, 10,000].
//class Solution {
//    func findMaxAverage(_ nums: [Int], _ k: Int) -> Double {
//    }
//}



// Time Is Money