문제 처음 내 풀이 def solution(name): def upper(char): return ord(char) - ord('A') def down(char): return ord('Z') - ord(char) + 1 up_down = [min(upper(i),down(i)) for i in name] right = len(name) - 1 count = sum(up_down) + right if 'A' not in name: return count else : left = 0 left_count = 0 for i in range(len(name)-1): next = i + 1 while name[next] == 'A' and next < len(name): left_count += (left * 2..