- There are three situations
- Note: For this situation, we just need to rotate it, and it becomes situation1.
You are given an array of integers
You start at point
(0,0) on an X-Y plane and you move
distance meters to the north, then
distance meters to the west, distance meters to the south, distance meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise.
true if your path crosses itself, and
false if it does not.
Input: distance = [2,1,1,2]