a0643_maximum_average_subarray_i.rs

/*
 * [0643] maximum-average-subarray-i
 */

pubstructSolution{}

// solution impl starts here

implSolution{
pubfnfind_max_average(nums:Vec<i32>,k:i32) -> f64{
letmut max_sum;
letmut sum = 0;
for i in0..=k - 1{
 sum += nums[i asusize];
}
 max_sum = sum;
for i in k..=(nums.len() - 1)asi32{
 sum = sum - nums[(i - k)asusize] + nums[i asusize];
 max_sum = if sum > max_sum { sum }else{ max_sum };
}

 max_sum asf64 / k asf64
}
}

// solution impl ends here

// solution tests starts here

#[cfg(test)]
mod tests {
usesuper::*;

#[test]
fntest_case0(){
assert_eq!(Solution::find_max_average(vec![1,2,3,4],2),3.5f64);
assert_eq!(
Solution::find_max_average(vec![1,12, -5, -6,50,3],4),
12.75f64
);
}
}

// solution tests ends here