Positive Product

Java

public int positiveProduct (int[] array) {
    //corner case
    if (array == null || array.length == 0) {
        return -1;
    }
    
    int result = 1;
    int count = 0;
    for (int i = 0; i < array.length; i++) {
        if (array[i] > 0) {
            result *= array[i];
        } else {
            count++;
        }
    }
    return count == array.length ? -1 : result;
}