मध्यम 0 हल किए गए 0% स्वीकृति

Step Tracker Class

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

आप क्या सीखेंगे

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

समस्या

अनुवाद दिखाएँ

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.

सीमाएँ

1 ≤ min_active ≤ 100,000

0 ≤ number of operations ≤ 1,000

0 ≤ N ≤ 100,000

उदाहरण

उदाहरण 1
इनपुट:
min_active = 8000
operations = ["add 9000", "add 4500", "active", "add 12000", "total", "average", "best"]

अपेक्षित आउटपुट:
expected = [1, 25500, 8500, 12000]
इनपुट:
long long min_active = 8000;
std::vector<std::string> operations = {"add 9000", "add 4500", "active", "add 12000", "total", "average", "best"};

अपेक्षित आउटपुट:
std::vector<long long> expected = {1, 25500, 8500, 12000};
इनपुट:
long min_active = 8000;
string[] operations = new string[] {"add 9000", "add 4500", "active", "add 12000", "total", "average", "best"};

अपेक्षित आउटपुट:
long[] expected = new long[] {1, 25500, 8500, 12000};

व्याख्या

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.

उदाहरण 2
इनपुट:
min_active = 5000
operations = ["average", "best", "add 5000", "add 4999", "active", "average"]

अपेक्षित आउटपुट:
expected = [0, 0, 1, 4999]
इनपुट:
long long min_active = 5000;
std::vector<std::string> operations = {"average", "best", "add 5000", "add 4999", "active", "average"};

अपेक्षित आउटपुट:
std::vector<long long> expected = {0, 0, 1, 4999};
इनपुट:
long min_active = 5000;
string[] operations = new string[] {"average", "best", "add 5000", "add 4999", "active", "average"};

अपेक्षित आउटपुट:
long[] expected = new long[] {0, 0, 1, 4999};

व्याख्या

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

कैसे हल करें

पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।

संकेत 1

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

संकेत 2

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

संकेत 3

Check for zero days before dividing.

अपेक्षित जटिलता

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

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

हर कोडर का सबसे अच्छा पास हुआ समाधान। तेज़, कम मेमोरी वाले और बेहतर रेटिंग वाले समाधान ऊपर रहते हैं।

अभी कोई पास हुआ समाधान नहीं है। इसे हल करें और पहला स्थान पाएँ।

दूसरों से सीखें

समुदाय समाधान

अभी तक कोई प्रकाशित समाधान नहीं। पहला साझा करने के लिए इस चुनौती को हल करें।