class Solution { public int minimumAverageDifference(int[] nums) { int n = nums.length, res = 0; long min = Integer.MAX_VALUE; long[] sum = new long[n + 1]; for (int i = 0; i < n; i++) { sum[i + 1] = sum + nums; } for (int i = 0; i < n; i++) { long diff = Math.abs(sum[i + 1] / (i + 1) - ((n - i - 1 == 0) ? 0 : (sum[n] - sum[i + 1]) / (n - i - 1))); if (diff < min) { res = i; min = diff; } } return res; }}