방문 길이

https://programmers.co.kr/learn/courses/30/lessons/49994

코딩테스트 연습 - 방문 길이

function solution(dirs) {
    let cur = [0, 0];
    const dObj = {
        "U": [-1, 0],
        "D": [1, 0],
        "L": [0, -1],
        "R": [0, 1],
    };
    const track = new Set();
    for (let dir of dirs) {
        const ny = cur[0] + dObj[dir][0];
        const nx = cur[1] + dObj[dir][1];
        if (ny > 5 || ny < -5 || nx > 5 || nx < -5) continue;
        track.add(`${cur[0]}${cur[1]}${ny}${nx}`);
        track.add(`${ny}${nx}${cur[0]}${cur[1]}`);
        cur = [ny, nx]; 
    }
    return track.size / 2;
}

 

풀이해설

https://after-newmoon.tistory.com/92

[프로그래머스] 방문길이 /JavaScript