##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Maintain a running sum of elements. Slide the window by adding the new element and removing the old one.
Compute sum of first elements.
For each position from to :
nums[i] (entering the window).nums[i-k] (leaving the window).Return max sum divided by .