PROGRAMMERS 49994: 방문 길이

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

---

Python

def solution(dirs):
    result = 0
    history_path = dict()
    pos = (0, 0)  # X Y
    for i in dirs:
        if i == 'L':
            if pos[0] - 1 < -5:
                continue
            if (pos[0], pos[1], 'L') not in history_path:
                history_path[(pos[0], pos[1], 'L')] = None
                history_path[(pos[0] - 1, pos[1], 'R')] = None
                result += 1
            pos = (pos[0] - 1, pos[1])
        elif i == 'R':
            if pos[0] + 1 > 5:
                continue
            if (pos[0], pos[1], 'R') not in history_path:
                history_path[(pos[0], pos[1], 'R')] = None
                history_path[(pos[0] + 1, pos[1], 'L')] = None
                result += 1
            pos = (pos[0] + 1, pos[1])
 
        elif i == 'U':
            if pos[1] - 1 < -5:
                continue
            if (pos[0], pos[1], 'U') not in history_path:
                history_path[(pos[0], pos[1], 'U')] = None
                history_path[(pos[0], pos[1] - 1, 'D')] = None
                result += 1
            pos = (pos[0], pos[1] - 1)
 
        elif i == 'D':
            if pos[1] + 1 > 5:
                continue
            if (pos[0], pos[1], 'D') not in history_path:
                history_path[(pos[0], pos[1], 'D')] = None
                history_path[(pos[0], pos[1] + 1, 'U')] = None
                result += 1
            pos = (pos[0], pos[1] + 1)
 
    return result

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com