refactored code

Author: S-M-J-I

src/main/java/com/thealgorithms/others/MaximumAverageOfContiguousSubArraysWithK.java

@@ -38,7 +38,7 @@ public double maxAverage(int k, int... numbers) {
         double MAX = Integer.MIN_VALUE; // Keep track of the maximum average
         double runningSum = 0; // Keep track of the running sum
         // For all elements in the array
-        for(int i = 0; i < numbers.length; ++i) {
+        for (int i = 0; i < numbers.length; ++i) {
             runningSum += numbers[i]; // Add the current element to the running sum
             if (i >= k - 1) { // If we reach a minimum number of k elements
                 double div = runningSum / k; // Find the average

src/test/java/com/thealgorithms/others/MaximumAverageOfContiguousSubArraysWithKTest.java

@@ -19,7 +19,7 @@ public void testCaseOneNormal() {
         int[] numbers = new int[] {1,12,-5,-6,50,3};
         int k = 4;
         double answer = 12.75;
-        double result = solution.maxAverage(k,numbers);
+        double result = solution.maxAverage(k, numbers);
         assertEquals(answer, result);
     }
 
@@ -28,7 +28,7 @@ public void testCaseTwoOneElement() {
         int[] numbers = new int[] {5};
         int k = 1;
         double answer = 5.00;
-        double result = solution.maxAverage(k,numbers);
+        double result = solution.maxAverage(k, numbers);
         assertEquals(answer, result);
     }
 
@@ -37,23 +37,16 @@ public void testCaseThreeNegativeElement() {
         int[] numbers = new int[] {-1};
         int k = 1;
         double answer = -1.00;
-        double result = solution.maxAverage(k,numbers);
+        double result = solution.maxAverage(k, numbers);
         assertEquals(answer, result);
     }
 
     @Test
     public void testCaseFourNearLimit() {
-        int[] numbers = new int[] {
-                8860,-853,6534,4477,-4589,8646,-6155,-5577,-1656,-5779,-2619,-8604,-1358,-8009,
-                4983,7063,3104,-1560,4080,2763,5616,-2375,2848,1394,-7173,-5225,-8244,-809,8025,
-                -4072,-4391,-9579,1407,6700,2421,-6685,5481,-1732,-8892,-6645,3077,3287,-4149,8701,
-                -4393,-9070,-1777,2237,-3253,-506,-4931,-7366,-8132,5406,-6300,-275,-1908,67,3569,1433,
-                -7262,-437,8303,4498,-379,3054,-6285,4203,6908,4433,3077,2288,9733,-8067,3007,9725,9669,
-                1362,-2561,-4225,5442,-9006,-429,160,-9234,-4444,3586,-5711,-9506,-79,-4418,-4348,-5891
-        };
+        int[] numbers = new int[] {8860,-853,6534,4477,-4589,8646,-6155,-5577,-1656,-5779,-2619,-8604,-1358,-8009,4983,7063,3104,-1560,4080,2763,5616,-2375,2848,1394,-7173,-5225,-8244,-809,8025,-4072,-4391,-9579,1407,6700,2421,-6685,5481,-1732,-8892,-6645,3077,3287,-4149,8701,-4393,-9070,-1777,2237,-3253,-506,-4931,-7366,-8132,5406,-6300,-275,-1908,67,3569,1433,-7262,-437,8303,4498,-379,3054,-6285,4203,6908,4433,3077,2288,9733,-8067,3007,9725,9669,1362,-2561,-4225,5442,-9006,-429,160,-9234,-4444,3586,-5711,-9506,-79,-4418,-4348,-5891};
         int k = 93;
-        double answer = -594.58065;
-        double result = solution.maxAverage(k,numbers);
+        double answer = -594.5806451612904;
+        double result = solution.maxAverage(k, numbers);
         assertEquals(answer, result);
     }
 }