Skip to content

ben-w-martin/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

21 Commits
 
 
 
 
 
 
 
 

Repository files navigation

  1. The function has two loops.
  2. The first loop finds the sum of the initial subarray, beginning with index 0 to the index k.
  3. Rather than continuing to perform iterating operations to find future sums, the first sum is used in the second loop as a starting point.
  4. The previous index is subtracted, and the first index past i + k is added.
  5. The average is calculated and compared with the max for each iteration.

About

My Leetcode solutions.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published