[LeetCode/Java] Maximum Average Subarray I

-Code

class Solution {
    public double findMaxAverage(int[] nums, int k) {
        int numsLength = nums.length;
        double nowSum = 0;
        double answer = 0;

        for (int i = 0; i < k; i++) {
            nowSum += nums[i];
        }
        // 현재 평균
        answer = nowSum / k;

        for (int i = 0; i < numsLength - k; i++) {
            nowSum -= nums[i];
            nowSum += nums[k + i];
            // 새로운 평균이 큰 경우 바꾸기
            answer = Math.max(answer, nowSum / k);
        }
        return answer;
    }
}