Tous les défis
Moyen 0 résolus 0 % de réussite

Library Checkout System

Run a small library system: add copies, check books out with a three book limit, return them and answer queries.

Ce que vous allez apprendre

  • Track copies per title with a map
  • Track each member's books
  • Apply checks in the stated order

Problème

Afficher la traduction

A school library tracks how many copies of each title are on the shelf and which titles each member holds. Titles and member names are single words. Process these operations in order:

  • add <title>: one more copy of the title goes on the shelf (no output).
  • checkout <member> <title>: if the member already holds 3 books, output LIMIT. Otherwise, if no copy is on the shelf, output UNAVAILABLE. Otherwise the member takes a copy and the output is OK. A member may hold several copies of the same title.
  • return <member> <title>: if the member holds that title, one copy goes back on the shelf and the output is OK; otherwise output ERROR.
  • available <title>: output the number of copies on the shelf.
  • books <member>: output how many books the member holds.

Implement library_checkout(operations).

Input

operations: The operations, processed in order.

Output

Return every output as a string, in the order they happen (numbers are written in base 10, like "2").

Contraintes

0 ≤ number of operations ≤ 2,000

Titles and names have 1 to 20 letters or digits

Exemples

Exemple 1
Entrée :
operations = ["add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"]

Sortie attendue :
expected = ["OK", "UNAVAILABLE", "0", "OK", "OK"]
Entrée :
std::vector<std::string> operations = {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Sortie attendue :
std::vector<std::string> expected = {"OK", "UNAVAILABLE", "0", "OK", "OK"};
Entrée :
string[] operations = new string[] {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Sortie attendue :
string[] expected = new string[] {"OK", "UNAVAILABLE", "0", "OK", "OK"};

Explication

Ana takes the only copy, so Ben gets UNAVAILABLE and 0 copies are left. After Ana returns it, Ben gets it: ["OK", "UNAVAILABLE", "0", "OK", "OK"].

Exemple 2
Entrée :
operations = ["add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"]

Sortie attendue :
expected = ["OK", "OK", "OK", "LIMIT", "ERROR", "3"]
Entrée :
std::vector<std::string> operations = {"add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"};

Sortie attendue :
std::vector<std::string> expected = {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};
Entrée :
string[] operations = new string[] {"add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"};

Sortie attendue :
string[] expected = new string[] {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};

Explication

Kim reaches 3 books, so the fourth checkout gives LIMIT; returning D fails with ERROR because Kim never got it, and Kim holds 3.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

Use one map from title to shelf copies and one from member to the titles they hold.

Indice 2

Check the 3 book limit before checking the shelf.

Indice 3

A return only works if that title is in the member's list; remove just one copy of it.

Complexité attendue

O(q) time, O(q) extra space

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.