[8월 코테 챌린지] 프로그래머스 :: (Lv0) 225개 (Lv1) 63개 (Lv2) 36개 (Lv3) 4개 // 누적 328개

2024/08/29

(Lv0) 225개 (Lv1) 63개 (Lv2) 36개 (Lv3) 4개 // 누적 328개

---

풀이한 문제

Lv2

1. 방문 길이

프로그래머스

 

문제 풀이

def solution(dirs):
    an = {}
    
    U = 0 ; D = 0 ;R = 0 ; L = 0
    location = [0,0]
    for i in dirs:
        road = str(location)
        if i == 'L':
            if location[0] == -5:
                pass
            else:
                location[0] -= 1
                a = str(location)
                road1 = a+road
                road += a
                if (road not in an) and (road1 not in an):
                    an[road]=0
                
        elif i == 'R':
            if location[0] == 5:
                pass
            else:
                location[0] += 1
                a = str(location)
                road1 = a+road
                road += a
                if (road not in an) and (road1 not in an):
                    an[road]=0
                
        elif i == 'U':
            if location[1] == 5:
                pass
            else:
                location[1] += 1
                a = str(location)
                road1 = a+road
                road += a
                if (road not in an) and (road1 not in an):
                    an[road]=0
                    
        elif i == 'D':
            if location[1] == -5:
                pass
            else:
                location[1] -= 1
                a = str(location)
                road1 = a+road
                road += a
                if (road not in an) and (road1 not in an):
                    an[road]=0
                    
    answer = len(an)
    return answer

 

Lv2. 방문 길이

---

미완성 문제

Lv2

1. 구명보트
2. 피로도