Special Array I

An array is considered special if every pair of its adjacent elements contains two numbers with different parity.

You are given an array of integers nums. Return true if nums is a special array, otherwise, return false.

LeetCode Problem - 3151

class Solution {
    // Method to determine if an array is "special"
    // An array is "special" if consecutive elements have different parities (one is even, the other is odd)
    public boolean isArraySpecial(int[] nums) {
        // If the array has only one element, it's considered special
        if(nums.length == 1) return true;

        // Iterate over the array elements except the last one
        for(int i = 0; i < nums.length - 1; i++) {
            // Check the parity of consecutive elements
            boolean flag = checkParity(nums[i], nums[i + 1]);
            // If consecutive elements have the same parity, return false
            if(!flag) return false;
        }
        // If all consecutive elements have different parities, return true
        return true;
    }

    // Method to check the parity of two numbers
    public boolean checkParity(int x, int y) {
        // Determine the parity of the first number
        boolean temp1;
        if(x % 2 == 0) temp1 = true; // Even
        else temp1 = false; // Odd

        // Determine the parity of the second number
        boolean temp2;
        if(y % 2 == 0) temp2 = true; // Even
        else temp2 = false; // Odd

        // Return true if the numbers have different parities, otherwise return false
        if(temp1 == temp2) return false;
        else return true;
    }
}