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 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);
```

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

362. Design Hit Counter
``````use std::collections::VecDeque;

#[derive(Default)]
struct HitCounter {
queue: VecDeque<i32>,
}

impl HitCounter {
fn new() -> Self {
HitCounter {
queue: VecDeque::new(),
}
}

fn hit(&mut self, timestamp: i32) {
while let Some(first) = self.queue.front() {
if first + 300 <= timestamp {
self.queue.pop_front();
} else {
break;
}
}
self.queue.push_back(timestamp);
}

fn get_hits(&mut self, timestamp: i32) -> i32 {
while let Some(first) = self.queue.front() {
if first + 300 <= timestamp {
self.queue.pop_front();
} else {
break;
}
}
self.queue.len() as i32
}
}

#[test]
fn test() {
let mut obj = HitCounter::new();
obj.hit(1);
obj.hit(2);
obj.hit(3);
assert_eq!(obj.get_hits(4), 3);
obj.hit(300);
assert_eq!(obj.get_hits(300), 4);
assert_eq!(obj.get_hits(301), 3);
}
``````