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

public static int lengthSaw(int[] array) {
    int length = 0;
    int maxLength = 0;
    boolean isPrev = false;
    for (int i = 1; i < array.length - 1; i++) {
        if(array[i - 1] < array[i] && array[i] > array[i + 1]) {
            if(isPrev) {
                length += 2;
            } else {
                length = 3;
                isPrev = true;
            }
            i++;
        } else {
            isPrev = false;
            maxLength = Math.max(maxLength, length);
        }
    }
    return Math.max(maxLength, length);
}

public static int solve(int[] arr) {
    int res = 0;
    int count = 0;

    for (int i = 1; i < arr.length - 1; i += 2) {
        if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) {
            count++;
        }
        else {
            res = Math.max(res, count);
            count = 0;
        }
    }
    res = Math.max(res, count);

    for (int i = 2; i < arr.length - 1; i += 2) {
        if (arr[i] > arr[i - 1] && arr[i] > arr[i + 1]) {
            count++;
        }
        else {
            res = Math.max(res, count);
            count = 0;
        }
    }
    res = Math.max(res, count);

    return res * 2 + 1;
}