golang 解法, 执行用时: 0 ms, 内存消耗: 2.2 MB, 提交时间: 2021-06-29 18:18:13

func isPathCrossing(path string) bool {
	x, y := 0, 0
	routes := map[int]struct{}{}
    routes[0] = struct{}{}
	for _, c := range path {
		if c == rune('N') {
			y++
		} else if c == rune('S') {
			y--
		} else if c == rune('E') {
			x++
		} else if c == rune('W') {
			x--
		}
		if _, has := routes[x*20001+y]; has {
			return true
		}
		routes[x*20001+y] = struct{}{}
	}

	return false
}