Exam 3. Longest Odd-Even Sequence

import java.util.Scanner;

public class _3_LongestOdd_EvenSequence {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner scan = new Scanner(System.in);
        String inputLine = scan.nextLine().trim();

        String[] inputs = inputLine.split("[) (]+");
        int[] numbers = new int[inputs.length - 1];
        for (int i = 0; i < numbers.length; i++) {
            numbers[i] = Integer.parseInt(inputs[i + 1]);
        }

        int maxNumsSequence = 0;
        int countNumsInSeq = 0;
        int countZeroes = 0;
        int previousNum = 0;
        for (int num : numbers) {
            if (num == 0) {
                countZeroes++;
                countNumsInSeq++;
            } else {
                boolean isOddNum = num % 2 != 0;
                if (previousNum == 0
                    || (previousNum % 2 == 0 && isOddNum && countZeroes % 2 == 0)
                    || (previousNum % 2 != 0 && !isOddNum && countZeroes % 2 == 0)
                    || (previousNum % 2 != 0 && isOddNum && countZeroes % 2 != 0)
                    || (previousNum % 2 == 0 && !isOddNum && countZeroes % 2 != 0)) {
                    countNumsInSeq++;
                } else {
                    countNumsInSeq = 1;
                }

                previousNum = num;
                countZeroes = 0;
            }

            if (countNumsInSeq > maxNumsSequence) {
                maxNumsSequence = countNumsInSeq;
            }
        }

        System.out.println(maxNumsSequence);
    }
}