Кухня(); Задание N25.

public static int getMaxSum(int[] array) {
        int maxSum = array[0] + array[array.length - 1];
        for (int i = 1; i < array.length / 2; i++) {
            if ((array[i] + array[array.length - i - 1]) > maxSum) {
                maxSum = array[i] + array[array.length - i - 1];
            }

        }
        return maxSum;
    }

public static double getSummOf2Numbers(double[] arr) {
        double max = Integer.MIN_VALUE;
        for (int i = 0; i < (arr.length + 1) / 2; i++) {
            max = arr[i] + arr[arr.length - 1 - i] > max && i != arr.length - 1 - i ? arr[i] + arr[arr.length - 1 - i] : max;
            max = arr[i] + arr[arr.length - 1 - i] > max && i == arr.length - 1 - i ? arr[i] : max;
        }
        return max;
    }

public static double max(double[] arr) {
    double max = Double.MIN_VALUE;
    for (int i = 0, j = arr.length - 1; i < j; i++, j--) {
        max = Double.max(max, arr[i] + arr[j]);
    }
    return max;
}