[LeetCode] Ant on the Boundary

1 · · Feb. 4, 2024, 5:40 a.m.
3028. Ant on the Boundary An ant is on a boundary. It sometimes goes left and sometimes right. You are given an array of non-zero integers nums. The ant starts reading nums from the first element of it to its end. At each step, it moves according to the value of the current element: If nums[i] < 0, it moves left by -nums[i] units. If nums[i] > 0, it moves right by nums[i] units. Return the number of times the ant returns to the boundary. Notes: There is an infinite space on both sides of the...