Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
각 알파벳을 0-9 숫자로 매핑하여 주어진 단어들의 합을 최대화하는 문제
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
각 알파벳을 0-9 숫자로 매핑하여 주어진 단어들의 합을 최대화하는 문제
🔍 풀이 방법
그리디, 어짜피 정렬할거니까 그냥 신경쓰지말고 큰거부터 차례대로 할당하고 모두 합하면됨
자릿수별 가중치 계산하고 큰순서대로 9부터 할당하기
⏳ 회고
개꿀잼문제