这篇博客详细介绍了LeetCode上的1496题——路径交叉问题。通过给出的字符串表示的四个方向（北、南、东、西），判断从原点开始的行走路径是否在任意时刻经过之前已经走过的点。文章提供了关键的解题思路和Python实现代码，帮助读者理解如何检测路径交叉情况。
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: f
订阅专栏 解锁全文
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
