JAVA_Maximum Average Subarray I

JAVA_Maximum Average Subarray I_LeetCode 643 풀이 class Solution { public double findMaxAverage(int[] nums, int k) { double max = Integer.MIN_VALUE; double avg = 0; double sum = 0; for(int i = 0; i<nums.length; i++) { sum += nums[i]; if(i >= k - 1) { avg = sum / k; max = Math.max(max,avg); sum -= nums[i - (k - 1)]; } } return max; } } * 출처 Maximum Average Subarray I - LeetCode Maximum Average Subarray I - You are given an integer array nums consisting of n elements, and an integer k. Find a contig...

#JAVA #JAVA_LeetCode643 #JAVA_MaximumAverageSubarrayI #JAVA_MaximumAverageSubarrayI_LeetCode643 #MaximumAverageSubarrayI_LeetCode643

원문링크 : JAVA_Maximum Average Subarray I_LeetCode 643