如何在 Java 中找到未排序的整数数组的中位数？

Question

我必须找到中位数之前和之后的元素的总和，尽可能接近。例如： 输入：{4,5,99,-1,5,6} 输出：3（索引为 3 的元素） //我们从 1 开始计数

public int median(int[] array) {
    int index = 0;
    int minSum;
    int sum = 0;
    int leftSum = 0;
    int rightSum = 0;
    int[] subtraction = new int[array.length];

    for (int i = 1; i < array.length; i++) {
        sum = array[i] + sum;
    }
    rightSum = sum;
    subtraction[0] = rightSum - leftSum;

    for (int i = 1; i < array.length; i++) {

        leftSum = leftSum + array[i - 1];

        rightSum = sum - array[i];
        if (leftSum > rightSum) {
            subtraction[i] = leftSum - rightSum;
        } else {
            subtraction[i] = rightSum - leftSum;
        }

    }

    minSum = subtraction[0];
    for (int i = 1; i < subtraction.length; i++) {
        if (subtraction[i] < minSum) {
            minSum = subtraction[i];
            index = i;
        }
    }

    return index + 1;
}

我知道我不必寻找最小值，但我找不到其他方法。我的问题是如何找到最接近的数字？

Answer 1

输出：

中位数为：5，索引：3

public class Hello {

      static int[] integerArray = {4,5,99,-1,5,6};

      public static void main(String[] args){
          List<Integer> sortedArray = new ArrayList<Integer>();

          //fill up a Collection (ArrayList<Integer>) with your array values
          for(int integer : integerArray){
              sortedArray.add(integer);
          }

          //sort the collection
          Collections.sort(sortedArray);

          //get the index of the median (middle item of a sorted list)
          int index = sortedArray.size() / 2;

          //print the median and it's index
          System.out.println("median is: " + sortedArray.get(index) + " at index: " + index);
      }
}