Leetcode 335 Solution

This article provides solution to leetcode question 335 (self-crossing)
Categories:
Tags:
Access this page by simply typing in "lcs 335" in your browser address bar if you have bunnylol configured.

https://leetcode.com/problems/self-crossing

Solution

class Solution {
public:
    bool isSelfCrossing(vector<int>& x) {
        for (int i = 3; i < x.size(); i++)
        {
            if (x[i] >= x[i - 2] && x[i - 1] <= x[i - 3])
                return true;



            if (i >= 4 && x[i] + x[i - 4] == x[i - 2] && x[i - 1] == x[i - 3])
                return true;



            if (i >= 5 && x[i - 2] <= x[i] + x[i - 4] && x[i - 4] <= x[i - 2] && x[i - 3] >= x[i - 1] && x[i - 3] <= x[i - 1] + x[i - 5])
                return true;
        }



        return false;
    }
};