그리디 - 조이스틱 / 파이썬

def solution(name):
    lst = [min(ord(n)-ord('A'), ord('Z')-ord(n)+1) for n in name]
    idx, answer = 0, 0
    while True:
        answer += lst[idx]
        lst[idx] = 0
        if sum(lst) == 0: break
        left, right = 1, 1
        while lst[idx-left] == 0:
            left += 1
        while lst[idx+right] == 0:
            right += 1
        if left < right:
            answer += left
            idx -= left
        else:
            answer += right
            idx += right
    return answer

 

 

programmers.co.kr/learn/courses/30/lessons/42860

코딩테스트 연습 - 조이스틱