LeetCode 1496. Path Crossing

Algorithm

LeetCode 1496. Path Crossing

쿠케캬캬 2023. 12. 23. 14:51

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

Path Crossing - LeetCode

Can you solve this real interview question? Path Crossing - 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

leetcode.com

이미 방문한 좌표를 기억해줍니다.

class Solution {
public:
    bool isPathCrossing(string path) {
        unordered_set<int> v;
        int x = 0, y = 0;
        v.insert(x * 10000 + y);
        for(char p : path) {
            if(p == 'N') {
                x--;
            } else if(p == 'S') {
                x++;
            } else if(p == 'E') {
                y++;
            } else {
                y--;
            }
            if(v.find(x * 10000 + y) != v.end()) return true;
            v.insert(x * 10000 + y);
        }
        return false;
    }
};