समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।