Leetcode 3354. Make Array Elements Equal to Zero

Count how many choices of a starting index at a zero and an initial left/right direction yield a deterministic walk—where stepping on a positive decrements it by 1 and flips direction, stepping on a zero continues in the same direction, and the process stops when you exit the array—that results in all array elements becoming zero. The core task is to simulate or reason about this walk for each zero position/direction under the given movement/reversal rules (n ≤ 100).