Maximum Average Subarray I

1class Solution {
2    public double findMaxAverage(int[] nums, int k) {
3        int sum = 0;
4        for (int i = 0; i < k; i++) {
5            sum += nums[i];
6        }
7
8        int maxSum = sum;
9        for (int i = k; i < nums.length; i++) {
10            // slide the window
11            sum -= nums[i - k];
12            sum += nums[i];
13
14            if (sum > maxSum) {
15                maxSum = sum;
16            }
17        }
18
19        return (double) maxSum / k;
20    }
21}