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

首先读懂题意，设计一个点击计数器，每个操作都是按顺序发生的，不会出现倒序发生的情况，其次follow up有说要考虑同一时间多次点击的情况，这里网上有一个非常巧妙的解法，分别用两个size为300的一维数组代表时间和点击数，每次发生hits时用时间戳和300取余，如果和times数组中的值不一样，说明已经不是这个300秒区间，需要重置点击数，如果一样那么点击数加一，代码：

/** Initialize your data structure here. */
private int[] hits;
private int[] times;
public HitCounter() {
    hits=new int[300];
    times=new int[300];
}

/** Record a hit.
 @param timestamp - The current timestamp (in seconds granularity). */
public void hit(int timestamp) {
   int k=timestamp%300;
    if(times[k]!=timestamp){
        times[k]=timestamp;
        hits[k]=1;
    }
    else hits[k]++;
}

/** Return the number of hits in the past 5 minutes.
 @param timestamp - The current timestamp (in seconds granularity). */
public int getHits(int timestamp) {
    int res=0;
    for(int i=0;i<300;i++){
        if(times[i]>timestamp-300)
            res+=hits[i];
    }
    return res;
}