Package g1401_1500.s1496_path_crossing

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1496 - Path Crossing.

    Easy

    Given a string path, where path[i] = 'N', 'S', 'E' or 'W', each representing moving one unit north, south, east, or west, respectively. You start at the origin (0, 0) on a 2D plane and walk on the path specified by path.

    Return true if the path crosses itself at any point, that is, if at any time you are on a location you have previously visited. Return false otherwise.

    Example 1:

    Input: path = "NES"

    Output: false

    Explanation: Notice that the path doesn't cross any point more than once.

    Example 2:

    Input: path = "NESWW"

    Output: true

    Explanation: Notice that the path visits the origin twice.

    Constraints:

    • <code>1 <= path.length <= 10<sup>4</sup></code>

    • path[i] is either 'N', 'S', 'E', or 'W'.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean isPathCrossing(String path)

      • Methods inherited from class java.lang.Object

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