Golang | Leetcode Golang题解之第335题路径交叉

题目：

题解：

func isSelfCrossing(distance []int) bool {n := len(distance)// 处理第 1 种情况i := 0for i < n && (i < 2 || distance[i] > distance[i-2]) {i++}if i == n {return false}// 处理第 j 次移动的情况if i == 3 && distance[i] == distance[i-2] ||i >= 4 && distance[i] >= distance[i-2]-distance[i-4] {distance[i-1] -= distance[i-3]}i++// 处理第 2 种情况for i < n && distance[i] < distance[i-2] {i++}return i != n
}