Alle Herausforderungen
Mittel 0 gelöst 0% Erfolgsquote

Library Checkout System

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

Das lernst du

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

Problem

Übersetzung anzeigen

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").

Einschränkungen

0 ≤ number of operations ≤ 2,000

Titles and names have 1 to 20 letters or digits

Beispiele

Beispiel 1
Eingabe:
operations = ["add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"]

Erwartete Ausgabe:
expected = ["OK", "UNAVAILABLE", "0", "OK", "OK"]
Eingabe:
std::vector<std::string> operations = {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Erwartete Ausgabe:
std::vector<std::string> expected = {"OK", "UNAVAILABLE", "0", "OK", "OK"};
Eingabe:
string[] operations = new string[] {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Erwartete Ausgabe:
string[] expected = new string[] {"OK", "UNAVAILABLE", "0", "OK", "OK"};

Erläuterung

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"].

Beispiel 2
Eingabe:
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"]

Erwartete Ausgabe:
expected = ["OK", "OK", "OK", "LIMIT", "ERROR", "3"]
Eingabe:
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"};

Erwartete Ausgabe:
std::vector<std::string> expected = {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};
Eingabe:
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"};

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

Erläuterung

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

So gehst du vor

Versuch es zuerst allein und öffne dann einen Hinweis nach dem anderen.

Hinweis 1

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

Hinweis 2

Check the 3 book limit before checking the shelf.

Hinweis 3

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

Erwartete Komplexität

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

Referenzen

Diese Aufgabe wurde für CodeUtility angepasst. Beachte die oben genannten Vorgaben und Einschränkungen.

Die beste bestandene Lösung jedes Coders. Schnellere, sparsamere und besser bewertete Lösungen stehen weiter oben.

Noch keine bestandene Lösung. Löse sie und hol dir Platz eins.

Von anderen lernen

Community-Lösungen

Noch keine veröffentlichten Lösungen. Löse die Aufgabe und teile als Erster eine Lösung.