package leetcode;

/**
 * https://leetcode.com/problems/mean-of-array-after-removing-some-elements/
 */
public class Problem1619 {
    public double trimMean(int[] arr) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1619 prob = new Problem1619();
        System.out.println(prob.trimMean(new int[]{1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3})); // 2.00000
        System.out.println(prob.trimMean(new int[]{6,2,7,5,1,2,0,3,10,2,5,0,5,5,0,8,7,6,8,0})); // 4.00000
        System.out.println(prob.trimMean(new int[]{6,0,7,0,7,5,7,8,3,4,0,7,8,1,6,8,1,1,2,4,8,1,9,5,4,3,8,5,10,8,6,6,1,0,6,10,8,2,3,4})); // 4.77778
        System.out.println(prob.trimMean(new int[]{9,7,8,7,7,8,4,4,6,8,8,7,6,8,8,9,2,6,0,0,1,10,8,6,3,3,5,1,10,9,0,7,10,0,10,4,1,10,6,9,3,6,0,0,2,7,0,6,7,2,9,7,7,3,0,1,6,1,10,3})); // 5.27778
        System.out.println(prob.trimMean(new int[]{4,8,4,10,0,7,1,3,7,8,8,3,4,1,6,2,1,1,8,0,9,8,0,3,9,10,3,10,1,10,7,3,2,1,4,9,10,7,6,4,0,8,5,1,2,1,6,2,5,0,7,10,9,10,3,7,10,5,8,5,7,6,7,6,10,9,5,10,5,5,7,2,10,7,7,8,2,0,1,1})); // 5.29167
    }
}

@@ -12,16 +12,42 @@
 tcode;%0A%0A
+import java.util.Arrays;%0A%0A
 /**%0A * h
@@ -202,921 +202,226 @@
     
-// TODO%0A        return 0
+Arrays.sort(arr)
 ;%0A    
-%7D%0A%0A
     
-public static void main(String%5B%5D args) %7B%0A        Problem1619 prob = new Problem1619();%0A        System.out.println(prob.trimMean(new int%5B%5D%7B1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3%7D)); // 2.00000%0A        System.out.println(prob.trimMean(new int%5B%5D%7B6,2,7,5,1,2,0,3,10,2,5,0,5,5,0,8,7,6,8,0%7D)); // 4.00000%0A        System.out.println(prob.trimMean(new int%5B%5D%7B6,0,7,0,7,5,7,8,3,4,0,7,8,1,6,8,1,1,2,4,8,1,9,5,4,3,8,5,10,8,6,6,1,0,6,10,8,2,3,4%7D)); // 4.77778%0A        System.out.println(prob.trimMean(new int%5B%5D%7B9,7,8,7,7,8,4,4,6,8,8,7,6,8,8,9,2,6,0,0,1,10,8,6,3,3,5,1,10,9,0,7,10,0,10,4,1,10,6,9,3,6,0,0,2,7,0,6,7,2,9,7,7,3,0,1,6,1,10,3%7D)); // 5.27778%0A        System.out.println(prob.trimMean(new int%5B%5D%7B4,8,4,10,0,7,1,3,7,8,8,3,4,1,6,2,1,1,8,0,9,8,0,3,9,10,3,10,1,10,7,3,2,1,4,9,10,7,6,4,0,8,5,1,2,1,6,2,5,0,7,10,9,10,3,7,10,5,8,5,7,6,7,6,10,9,5,10,5,5,7,2,10,7,7,8,2,0,1,1%7D)); // 5.29167
+double j = arr.length * 0.05;%0A        double sum = 0;%0A        for (int i = (int) j; i %3C arr.length - j; i++) %7B%0A            sum += arr%5Bi%5D;%0A        %7D%0A        return sum / (arr.length - (j * 2));
 %0A   

Solve problem 1619