[프로그래머스 Lv.2] 알고리즘 고득점 Kit 탐욕법(Greedy) - 조이스틱

✨ 정답 ✨

function solution(name) {
 var answer = 0;
  let min = name.length - 1;

  for (let i = 0; i < name.length; i++) {
    let currentAlphabet = name.charCodeAt(i);

    if (currentAlphabet < 78) {
      answer += currentAlphabet % 65;
    } else {
      answer += 91 - currentAlphabet;
    }

    let nextIndex = i + 1;

    while (nextIndex < name.length && name.charCodeAt(nextIndex) === 65) {
      nextIndex += 1;
    }
    min = Math.min(
      min,
      i * 2 + name.length - nextIndex, 
      i + (name.length - nextIndex) * 2
    );
  }
  answer += min;
  return answer;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡