Maximum product contiguous subarray
Follow PEP8 style guide for variable and function naming convention. Both the variables and function names should have snake_case names.
You can use enumerate to get index and value while iterating a list.


For constant space solution, instead of using a list to keep track of current max and min products, use a variable for both positive product and negative product. If the current number is \$ 0 \$, reset them both to \$ 1 \$ (They should be initialised as \$ 1 \$ as well). At the end of for-loop (inside the loop), keep updating your current_max value to keep track of max product encountered so far.

As edge cases, you may also consider returning (or raising errors) when input was empty etc.