Jane's PS Blog

Programmers 조이스틱

August 08, 2021

Solution

  • 1차 시도: 실패
def solution(name):
    answer = 0
    location = []
    for n in name:
        location.append(min(ord(n) - ord('A'), ord('Z') - ord(n) + 1))

    idx = 0
    while True:
        answer += location[idx]
        location[idx] = 0
        if sum(location) == 0:
            break
        left = 1
        right = 1
        while location[idx - left] == 0:
            left += 1
        while location[idx + right] == 0:
            right += 1
        if left > right:
            answer += right
            idx += right
        else:
            answer += left
            idx -= left
    return answer

  • 통과되는 코드

    • left==right인 경우에서 오른쪽으로 가야만 정답처리된다.
def solution(name):
    answer = 0
    location = []
    for n in name:
        location.append(min(ord(n) - ord('A'), ord('Z') - ord(n) + 1))

    idx = 0
    while True:
        answer += location[idx]
        location[idx] = 0
        if sum(location) == 0:
            break
        left = 1
        right = 1
        while location[idx - left] == 0:
            left += 1
        while location[idx + right] == 0:
            right += 1
        if left > right:
            answer += right
            idx += right
        elif right > left:
            answer += left
            idx -= left
        else:
            answer += right
            idx += right
    return answer
Written by@[Jisun Lim]
Carpe diem

GitHubVelogFacebook