[프로그래머스 Lv.2] Summer/Winter Coding(~2018) - 방문 길이

✨ 문제 ✨

✨ 정답 ✨

function solution(dirs) {
    let direction = { L: [-1, 0], R: [1, 0], U: [0, 1], D: [0, -1] };
    let current = [0, 0];
    let route = new Set();
    
    for (let dir of dirs) {
        let currentX = current[0] + direction[dir][0];
        let currentY = current[1] + direction[dir][1];
        
        if (currentX > 5 || currentX < -5 || currentY > 5 || currentY < -5) continue;
        
        route.add("" + current[0] + current[1] + currentX + currentY);
        route.add("" + currentX + currentY + current[0] + current[1]);
        
        current = [currentX, currentY];
    }
    
    return route.size / 2;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡