leetcode-75-solutions-java/src/queue/RecentCounter.java at main · teamlead/leetcode-75-solutions-java · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package queue;

import java.util.*;

class RecentCounter {

    Queue<Integer> queue;

    public RecentCounter() {
        queue = new LinkedList<>();
    }

    public int ping(int t) {
        queue.offer(t);
        while (queue.peek() < t - 3000) {
            queue.poll();
        }
        return queue.size();
    }


    public static void main(String[] args) {
        RecentCounter counter = new RecentCounter();

        // Test cases
        boolean passed = true;
        passed &= counter.ping(1) == 1;
        passed &= counter.ping(100) == 2;
        passed &= counter.ping(3001) == 3;
        passed &= counter.ping(3002) == 3;

        if (passed) {
            System.out.println("All test cases passed!");
        } else {
            System.out.println("Some test cases failed.");
        }
    }
}