Longest Odd-Even Sequence

function solve(input) {
    var numbers = input[0].split(/[ ()]+/);
    numbers = numbers.filter(Boolean).map(Number);

    var maxCounter = 0;
    var counter = 1;
    for (var i = 0; i < numbers.length - 1; i++) {

        var isOddCurrent = numbers[i] % 2 !== 0;
        var isOddNext = numbers[i + 1] % 2 !== 0;

        if (isOddCurrent !== isOddNext || numbers[i] == 0 || numbers[i + 1] == 0) {

            counter++;

        } else {
            if (maxCounter < counter) {
                maxCounter = counter;
            }

            counter = 1;
        }
    }

    console.log(maxCounter < counter ? counter : maxCounter);
}