[프로그래머스]조이스틱, python

def solution(name):
    alph = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
    max_len = 0
    max_index = -1
    
    for i in range(1,len(name)):
        search = 'A'* i
        index = name.find(search) 
        if index != -1:
            max_index = index
            max_len = i
            
    next_notA = max_index + max_len + 1
    if max_index != -1:
        move = min([len(name)-1, (max_index-1) + (len(name)+(max_index))-next_notA])
    else:
        move = len(name)-1
    
            
        
            
    for character in name:
        index = alph.index(character)
        dist1 = index
        dist2 = len(alph)-index
        
        move += min([dist1, dist2])
        
    return move

좌우로 움직여야하는 횟수, 위 아래로 움직여야 하는 횟수를 다르게 계산해서 더해줬다