CodeTest/leetcode/maximum-average-subarray-i/solution_1422656023.rs

impl Solution {
    pub fn find_max_average(nums: Vec<i32>, k: i32) -> f64 {
        let k = k as usize;
        let mut current_sum : i32 = nums[..k].iter().sum();
        let mut max_sum = current_sum;
        let length = nums.len();

        for i in 0..length - k{
            current_sum += nums[i + k] - nums[i];
            if max_sum < current_sum {
                max_sum = current_sum;
            }
        }
        
        (max_sum as f64) / (k as f64)
    }
}