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

Step Tracker Class

Simulate a step tracker object: record daily steps and answer total, active day, average and best day queries.

O que você vai aprender

  • Model a class as fields plus methods
  • Update counters as new data arrives
  • Handle queries before any data is recorded

Problema

Ver tradução

A fitness app has a StepTracker class. It is created with a goal min_active: a day counts as active when its steps are at least that number. Instead of writing the class, process its method calls as a list of operations:

  • add N: record a new day with N steps (no output).
  • total: output the total steps over all recorded days.
  • active: output how many recorded days are active.
  • average: output the average steps per day, rounded down to a whole number, or 0 if no day is recorded.
  • best: output the most steps in a single day, or 0 if no day is recorded.

Implement step_tracker(min_active, operations).

Input

min_active: The number of steps that makes a day active.

operations: The operations, processed in order.

Output

Return the outputs of the query operations in the order they happen.

Restrições

1 ≤ min_active ≤ 100,000

0 ≤ number of operations ≤ 1,000

0 ≤ N ≤ 100,000

Exemplos

Exemplo 1
Entrada:
min_active = 8000
operations = ["add 9000", "add 4500", "active", "add 12000", "total", "average", "best"]

Saída esperada:
expected = [1, 25500, 8500, 12000]
Entrada:
long long min_active = 8000;
std::vector<std::string> operations = {"add 9000", "add 4500", "active", "add 12000", "total", "average", "best"};

Saída esperada:
std::vector<long long> expected = {1, 25500, 8500, 12000};
Entrada:
long min_active = 8000;
string[] operations = new string[] {"add 9000", "add 4500", "active", "add 12000", "total", "average", "best"};

Saída esperada:
long[] expected = new long[] {1, 25500, 8500, 12000};

Explicação

After two days only 9000 reaches 8000, so active is 1. Then the total is 25500, the average is 25500 / 3 = 8500 and the best day is 12000.

Exemplo 2
Entrada:
min_active = 5000
operations = ["average", "best", "add 5000", "add 4999", "active", "average"]

Saída esperada:
expected = [0, 0, 1, 4999]
Entrada:
long long min_active = 5000;
std::vector<std::string> operations = {"average", "best", "add 5000", "add 4999", "active", "average"};

Saída esperada:
std::vector<long long> expected = {0, 0, 1, 4999};
Entrada:
long min_active = 5000;
string[] operations = new string[] {"average", "best", "add 5000", "add 4999", "active", "average"};

Saída esperada:
long[] expected = new long[] {0, 0, 1, 4999};

Explicação

With no days both queries give 0. 5000 counts as active but 4999 does not, and (5000 + 4999) / 2 rounds down to 4999.

Como abordar

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

Dica 1

Keep running values (total, days, active days, best) instead of rescanning a list.

Dica 2

A day is active when steps are greater than or equal to the goal.

Dica 3

Check for zero days before dividing.

Complexidade esperada

O(q) time, O(1) 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.