Package g0301_0400.s0335_self_crossing

Class Solution

java.lang.Object
g0301_0400.s0335_self_crossing.Solution
public class Solution extends java.lang.Object
335 - Self Crossing.

Hard

You are given an array of integers distance.

You start at point (0,0) on an X-Y plane and you move distance[0] meters to the north, then distance[1] meters to the west, distance[2] meters to the south, distance[3] meters to the east, and so on. In other words, after each move, your direction changes counter-clockwise.

Return true if your path crosses itself, and false if it does not.

Example 1:

Input: distance = [2,1,1,2]

Output: true

Example 2:

Input: distance = [1,2,3,4]

Output: false

Example 3:

Input: distance = [1,1,1,1]

Output: true

Constraints:

  • 1 <= distance.length <= 105
  • 1 <= distance[i] <= 105

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    boolean
    isSelfCrossing(int[] x)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • isSelfCrossing

      public boolean isSelfCrossing(int[] x)