@@ -0,0 +1,448 @@
+public class Solution %7B%0A%0A    public double findMaxAverage(int%5B%5D nums, int k) %7B%0A%0A        int sum = 0;%0A%0A        for (int i = 0; i %3C k; i++) %7B%0A            sum += nums%5Bi%5D;%0A        %7D%0A%0A        int max = sum;%0A%0A        for (int i = 0, j = k; j %3C nums.length; i++, j++) %7B%0A            sum = sum - nums%5Bi%5D + nums%5Bj%5D;%0A            max = Math.max(sum, max);%0A        %7D%0A%0A        double maxAverage = (double) max / (double) k;%0A%0A        return maxAverage;%0A%0A    %7D%0A%0A%7D%0A

Create : 643 Maximum Average Subarray I