Todos os desafios
Médio 0 resolvidos 0% de aceitação

Library Checkout System

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

O que você vai aprender

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

Problema

Ver tradução

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

Restrições

0 ≤ number of operations ≤ 2,000

Titles and names have 1 to 20 letters or digits

Exemplos

Exemplo 1
Entrada:
operations = ["add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"]

Saída esperada:
expected = ["OK", "UNAVAILABLE", "0", "OK", "OK"]
Entrada:
std::vector<std::string> operations = {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Saída esperada:
std::vector<std::string> expected = {"OK", "UNAVAILABLE", "0", "OK", "OK"};
Entrada:
string[] operations = new string[] {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Saída esperada:
string[] expected = new string[] {"OK", "UNAVAILABLE", "0", "OK", "OK"};

Explicação

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

Exemplo 2
Entrada:
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"]

Saída esperada:
expected = ["OK", "OK", "OK", "LIMIT", "ERROR", "3"]
Entrada:
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"};

Saída esperada:
std::vector<std::string> expected = {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};
Entrada:
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"};

Saída esperada:
string[] expected = new string[] {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};

Explicação

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

Como abordar

Tente sozinho primeiro e depois abra uma dica de cada vez.

Dica 1

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

Dica 2

Check the 3 book limit before checking the shelf.

Dica 3

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

Complexidade esperada

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

Referências

Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.

A melhor solução aprovada de cada programador. As mais rápidas, leves e mais bem avaliadas ficam no topo.

Ainda não há soluções aprovadas. Resolva e fique com o primeiro lugar.

Aprenda com outros

Soluções da comunidade

Ainda não há soluções publicadas. Resolva este desafio para compartilhar a primeira.