Self Crossing

Problem: Self Crossing

The situations are actually central symmetric, so we only need to consider one situation. The explanation of the following solution can be found here.

Code in Python:

class Solution(object):
    def isSelfCrossing(self, x):
        """
        :type x: List[int]
        :rtype: bool
        """
        b = c = d = e = 0
        for a in x:
            if d >= b > 0 and (a >= c or a >= c-e >= 0 and f >= d-b):
                return True
            b, c, d, e, f = a, b, c, d, e
        return False