Can we still get a O(n) solution with O(1) space if the input contains 0?

Currently, the problem states all the inputs are positive. And solutions are based on the idea to enumerate the 3 cross situations. While, if the input contains 0, i.e.,

1, 0, 1... there is a cross.