Design Hit Counter

Design a hit counter which counts the number of hits received in the past 5 minutes.

Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the timestamp is monotonically increasing). You may assume that the earliest timestamp starts at 1.

It is possible that several hits arrive roughly at the same time.

Example:

HitCounter counter = new HitCounter();

// hit at timestamp 1.
counter.hit(1);

// hit at timestamp 2.
counter.hit(2);

// hit at timestamp 3.
counter.hit(3);

// get hits at timestamp 4, should return 3.
counter.getHits(4);

// hit at timestamp 300.
counter.hit(300);

// get hits at timestamp 300, should return 4.
counter.getHits(300);

// get hits at timestamp 301, should return 3.
counter.getHits(301);

Follow up:
What if the number of hits per second could be very large? Does your design scale?

Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.

 1 public class HitCounter {
 2     private int[] hits;
 3     private int[] times;
 4     private int interval = 300;
 5
 6     /** Initialize your data structure here. */
 7     public HitCounter() {
 8         hits = new int[interval];
 9         times = new int[interval];
10     }
11
12     /** Record a hit.
13         @param timestamp - The current timestamp (in seconds granularity). */
14     public void hit(int timestamp) {
15         int index = timestamp % interval;
16
17         if (times[index] == timestamp) hits[index]++;
18         else {
19             hits[index] = 1;
20             times[index] = timestamp;
21         }
22     }
23
24     /** Return the number of hits in the past 5 minutes.
25         @param timestamp - The current timestamp (in seconds granularity). */
26     public int getHits(int timestamp) {
27         int result = 0;
28         for (int i = 0; i < interval; i++) {
29             if (timestamp - times[i] < 300)
30                 result += hits[i];
31         }
32         return result;
33     }
34 }
35
36 /**
37  * Your HitCounter object will be instantiated and called as such:
38  * HitCounter obj = new HitCounter();
39  * obj.hit(timestamp);
40  * int param_2 = obj.getHits(timestamp);
41  */
时间: 2024-11-10 00:55:04

Design Hit Counter的相关文章

Dropbox Interview – Design Hit Counter

Dropbox Interview – Design Hit Counter It starts with a simple question – if you are building a website, how do you count the number of visitors for the past 1 minute? "Design hit counter" problem has recently been asked by many companies includ

[LeetCode] Design Hit Counter 设计点击计数器

Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the times

Leetcode 362: Design Hit Counter

Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the times

[LC] 362. Design Hit Counter

Design a hit counter which counts the number of hits received in the past 5 minutes. Each function accepts a timestamp parameter (in seconds granularity) and you may assume that calls are being made to the system in chronological order (ie, the times

LeetCode &quot;Design Hit Counter&quot;

Hits come and go - so we use queue. Nothing special. class HitCounter { queue<int> q; public: /** Initialize your data structure here. */ HitCounter() { } /** Record a hit. @param timestamp - The current timestamp (in seconds granularity). */ void h

AN ESAY HIT COUNTER

1 <?php 2 $counts = ("hitcounter.txt"); 3 $hits = file($counts); 4 $hits[0] ++; 5 $fp = fopen($counts , "w"); 6 fputs($fp , "$hits[0]"); 7 fclose($fp); 8 echo "<h2>now,the hit count is:</h2>"."&l

【LeetCode】设计题 design(共38题)

p.p1 { margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px Helvetica } [146]LRU Cache [155]Min Stack [170]Two Sum III - Data structure design [173]Binary Search Tree Iterator [208]Implement Trie (Prefix Tree) [211]Add and Search Word - Data structure desig

过中等难度题目.0310

  .   8  String to Integer (atoi)    13.9% Medium   . 151 Reverse Words in a String      15.7% Medium     . 288 Unique Word Abbreviation      15.8% Medium     . 29 Divide Two Integers      16.0% Medium     . 166 Fraction to Recurring Decimal      17.

继续过中等难度.0309

  .   8  String to Integer (atoi)    13.9% Medium   . 151 Reverse Words in a String      15.7% Medium     . 288 Unique Word Abbreviation      15.8% Medium     . 29 Divide Two Integers      16.0% Medium     . 166 Fraction to Recurring Decimal      17.