조이스틱

조이스틱 - 프로그래머스

def solution(name):
    cnt = 0 
    idx = 0
    name = list(name)
    while True:
        right, left = 1, 1
        n = ord(name[idx])
        if n != 65:
            if n <= 78:
                cnt += n - 65
            else:
                cnt += 91 - n
            name[idx] = 'A'
        if name == ['A'] * len(name):
            break
        else:
            for i in range(1, len(name)+1):
                if name[idx + i] == 'A':
                    right += 1
                else: break
                if name[idx - i] == 'A':
                    left += 1
                else: break
            cnt += min(right, left)
            idx = (idx+right) if min(right, left) == right else (idx-left)
    return cnt