문제
A raffle gives each name a score. First sort the names alphabetically. A name's letter value adds A = 1, B = 2, ..., Z = 26 over its letters, and its score is that value times its position in the sorted list, counting from 1.
Implement name_scores(names).
Sort by plain character order, so a name comes before any longer name that starts with it ("AA" before "AAB").
Input
names: Names in uppercase letters A to Z. The same name can appear more than once; each copy is scored at its own position.
Output
Return the total of all scores. An empty list returns 0.
제약 조건
0 ≤ names.length ≤ 1000; 1 ≤ name length ≤ 20
예시
입력:
names = ["NORA", "ABE", "LIAM"]
예상 출력:
expected = 222
입력:
std::vector<std::string> names = {"NORA", "ABE", "LIAM"};
예상 출력:
long long expected = 222;
입력:
string[] names = new string[] {"NORA", "ABE", "LIAM"};
예상 출력:
long expected = 222;
설명
Sorted: ABE (8) × 1, LIAM (35) × 2, NORA (48) × 3, total 8 + 70 + 144 = 222.
입력:
names = ["ZOE", "AMY", "AMY"]
예상 출력:
expected = 255
입력:
std::vector<std::string> names = {"ZOE", "AMY", "AMY"};
예상 출력:
long long expected = 255;
입력:
string[] names = new string[] {"ZOE", "AMY", "AMY"};
예상 출력:
long expected = 255;
설명
Sorted: AMY, AMY, ZOE. AMY is worth 39 and ZOE 46: 39 × 1 + 39 × 2 + 46 × 3 = 255.
접근 방법
먼저 스스로 풀어 본 뒤 힌트를 하나씩 열어 보세요.
힌트 1
Sort first, then score; the position depends on the sorted order.
힌트 2
A letter's value is its character code minus the code of 'A' plus 1.
힌트 3
Positions start at 1, not 0.
예상 복잡도
O(n log n × L) time, O(n) extra space
참고 자료
이 문제는 CodeUtility에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.