LeetCode题解(0335)：路径交叉(Python)

题目：​​原题链接​​（困难）

标签：数学

解法一：

class Solution:
    def isSelfCrossing(self, x: List[int]) -> bool:
        for i in range(len(x)):
            if i >= 3:
                if x[i] >= x[i - 2] and x[i - 1] <= x[i - 3]:
                    return True
            if i >= 4:
                if x[i] >= x[i - 2] - x[i - 4] and x[i - 1] == x[i - 3]:
                    return True
            if i >= 5:
                if x[i] >= x[i - 2] - x[i - 4] and x[i - 1] >= x[i - 3] - x[i - 5] and x[i - 2] >= x[i - 4] and x[                    i - 3] >= x[i - 1]:
                    return True
        return False