add 2256

Author: fishercoder1534

README.md

@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty  | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
-| 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java)                                                                      || Easy                                                                          ||
+| 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java)                                                                     || Medium                                                                             ||
+| 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java)                                                                     || Easy                                                                          ||
 | 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java)                                                                     || Easy                                                                          ||
 | 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java)                                                                     || Medium                                                                        ||
 | 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java)                                                                     || Easy                                                                          ||

src/main/java/com/fishercoder/solutions/_2256.java

@@ -0,0 +1,40 @@
+package com.fishercoder.solutions;
+
+public class _2256 {
+    public static class Solution1 {
+        public int minimumAverageDifference(int[] nums) {
+            if (nums.length == 1) {
+                return 0;
+            }
+            long secondHalfSum = 0;
+            int minAveDiff = Integer.MAX_VALUE;
+            for (int i = 1; i < nums.length; i++) {
+                secondHalfSum += nums[i];
+            }
+            long firstHalfSum = nums[0];
+            int count = 1;
+            int minDiffIndex = 0;
+            for (int i = 0; i < nums.length; ) {
+                int firstHalfAve = (int) (firstHalfSum / count);
+                int secondHalfAve = 0;
+                if ((nums.length - count) != 0) {
+                    secondHalfAve = (int) (secondHalfSum / (nums.length - count));
+                }
+                if (minAveDiff > Math.abs(firstHalfAve - secondHalfAve)) {
+                    minAveDiff = Math.abs(firstHalfAve - secondHalfAve);
+                    minDiffIndex = i;
+                    if (minAveDiff == 0) {
+                        return minDiffIndex;
+                    }
+                }
+                count++;
+                i++;
+                if (i < nums.length) {
+                    firstHalfSum += nums[i];
+                    secondHalfSum -= nums[i];
+                }
+            }
+            return minDiffIndex;
+        }
+    }
+}