Problema
The student council election is a simple plurality vote: each voter writes one candidate's name, and the candidate with the most votes wins. A vote for a name that is not on the candidate list (a typo or a write-in) is thrown out. If several candidates share the highest count, they all win and share the office.
Implement plurality_election(candidates, votes).
Input
candidates: The candidates' names, all different.
votes: One name per voter. Names must match exactly, including case.
Output
Return the names of all winners in the order they appear in candidates. If no valid votes were cast, every candidate is tied at 0 and all are returned.
Vincoli
1 ≤ length of candidates ≤ 20
0 ≤ length of votes ≤ 1000
Names have 1 to 20 ASCII letters
Esempi
Input:
candidates = ["Ava", "Ben", "Cruz"]
votes = ["Ben", "Ava", "Ben", "Cruz", "Ben"]
Output atteso:
expected = ["Ben"]
Input:
std::vector<std::string> candidates = {"Ava", "Ben", "Cruz"};
std::vector<std::string> votes = {"Ben", "Ava", "Ben", "Cruz", "Ben"};
Output atteso:
std::vector<std::string> expected = {"Ben"};
Input:
string[] candidates = new string[] {"Ava", "Ben", "Cruz"};
string[] votes = new string[] {"Ben", "Ava", "Ben", "Cruz", "Ben"};
Output atteso:
string[] expected = new string[] {"Ben"};
Spiegazione
Ben has 3 votes, more than Ava and Cruz with 1 each, so ["Ben"].
Input:
candidates = ["Ava", "Ben", "Cruz"]
votes = ["Cruz", "Ava", "ava", "Dana"]
Output atteso:
expected = ["Ava", "Cruz"]
Input:
std::vector<std::string> candidates = {"Ava", "Ben", "Cruz"};
std::vector<std::string> votes = {"Cruz", "Ava", "ava", "Dana"};
Output atteso:
std::vector<std::string> expected = {"Ava", "Cruz"};
Input:
string[] candidates = new string[] {"Ava", "Ben", "Cruz"};
string[] votes = new string[] {"Cruz", "Ava", "ava", "Dana"};
Output atteso:
string[] expected = new string[] {"Ava", "Cruz"};
Spiegazione
ava and Dana are thrown out, leaving Ava and Cruz tied at 1: ["Ava", "Cruz"].
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Start every candidate at 0 votes so candidates without votes still count.
Suggerimento 2
Only count a vote when the name is exactly a candidate.
Suggerimento 3
Find the highest count first, then collect everyone with that count in list order.
Complessità attesa
O(c + v) time, O(c) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.