Problème
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.
Contraintes
0 ≤ names.length ≤ 1000; 1 ≤ name length ≤ 20
Exemples
Entrée :
names = ["NORA", "ABE", "LIAM"]
Sortie attendue :
expected = 222
Entrée :
std::vector<std::string> names = {"NORA", "ABE", "LIAM"};
Sortie attendue :
long long expected = 222;
Entrée :
string[] names = new string[] {"NORA", "ABE", "LIAM"};
Sortie attendue :
long expected = 222;
Explication
Sorted: ABE (8) × 1, LIAM (35) × 2, NORA (48) × 3, total 8 + 70 + 144 = 222.
Entrée :
names = ["ZOE", "AMY", "AMY"]
Sortie attendue :
expected = 255
Entrée :
std::vector<std::string> names = {"ZOE", "AMY", "AMY"};
Sortie attendue :
long long expected = 255;
Entrée :
string[] names = new string[] {"ZOE", "AMY", "AMY"};
Sortie attendue :
long expected = 255;
Explication
Sorted: AMY, AMY, ZOE. AMY is worth 39 and ZOE 46: 39 × 1 + 39 × 2 + 46 × 3 = 255.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Sort first, then score; the position depends on the sorted order.
Indice 2
A letter's value is its character code minus the code of 'A' plus 1.
Indice 3
Positions start at 1, not 0.
Complexité attendue
O(n log n × L) time, O(n) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.