5448. 判断路径是否相交

bool isPathCrossing(string path) {
    map<pair<int, int>, int> m;
    pair<int, int> p = make_pair(0, 0);
    m[p] = 1;
    for (auto it:path) {
        if (it == 'N')
            p.second++;
        else if (it == 'S')
            p.second--;
        else if (it == 'E')
            p.first++;
        else
            p.first--;

        if (m.count(p) == 1)
            return true;

        m[p] = 1;
    }
    return false;
}