Problème
C# records compare by value: two records are equal when all their fields are equal, even if they are different objects. That makes removing duplicates easy.
Each record is written name,city. Trim spaces around both fields; after trimming, two records are equal when both fields match exactly (case matters).
Implement unique_records(records).
Input
records: The records, in order.
Output
Return the distinct records in the order they first appear, written name,city with the trimmed fields.
Contraintes
0 ≤ number of records ≤ 100,000
Each field has 1 to 30 characters and no commas
Exemples
Entrée :
records = ["Ada,London", "Lin, Hanoi", "Ada , London"]
Sortie attendue :
expected = ["Ada,London", "Lin,Hanoi"]Entrée :
std::vector<std::string> records = {"Ada,London", "Lin, Hanoi", "Ada , London"};
Sortie attendue :
std::vector<std::string> expected = {"Ada,London", "Lin,Hanoi"};Entrée :
string[] records = new string[] {"Ada,London", "Lin, Hanoi", "Ada , London"};
Sortie attendue :
string[] expected = new string[] {"Ada,London", "Lin,Hanoi"};Explication
After trimming, the third record equals the first, so it is dropped: ["Ada,London", "Lin,Hanoi"].
Entrée :
records = ["ada,Paris", "Ada,Paris"]
Sortie attendue :
expected = ["ada,Paris", "Ada,Paris"]Entrée :
std::vector<std::string> records = {"ada,Paris", "Ada,Paris"};
Sortie attendue :
std::vector<std::string> expected = {"ada,Paris", "Ada,Paris"};Entrée :
string[] records = new string[] {"ada,Paris", "Ada,Paris"};
Sortie attendue :
string[] expected = new string[] {"ada,Paris", "Ada,Paris"};Explication
Case matters, so these two records are different: ["ada,Paris", "Ada,Paris"].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Trim both fields before comparing records.
Indice 2
A set of (name, city) pairs remembers which records you have seen.
Indice 3
Output each new record the first time it appears, in input order.
Complexité attendue
O(total length) time, O(number of records) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.