Number of Recent Calls (E)

題目

You have a RecentCounter class which counts the number of recent requests within a certain time frame.

Implement the RecentCounter class:

RecentCounter() Initializes the counter with zero recent requests.
int ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive range [t - 3000, t].

It is guaranteed that every call to ping uses a strictly larger value of t than the previous call.

Example 1:

Input
["RecentCounter", "ping", "ping", "ping", "ping"]
[[], [1], [100], [3001], [3002]]
Output
[null, 1, 2, 3, 3]

Explanation
RecentCounter recentCounter = new RecentCounter();
recentCounter.ping(1);     // requests = [1], range is [-2999,1], return 1
recentCounter.ping(100);   // requests = [1, 100], range is [-2900,100], return 2
recentCounter.ping(3001);  // requests = [1, 100, 3001], range is [1,3001], return 3
recentCounter.ping(3002);  // requests = [1, 100, 3001, 3002], range is [2,3002], return 3

Constraints:

1 <= t <= 104
Each test case will call ping with strictly increasing values of t.
At most 104 calls will be made to ping.

題意

在t時間增加一條記錄，同時回傳[t-3000, t]時間段內記錄的條數，

思路

兩種方法：

保存所有記錄，用二分法找到對應t-3000的位置；
利用滑動視窗，每次加入一條新記錄后，刪去所有t-3000之前的記錄，

代碼實作

Java

二分法

class RecentCounter {
    private List<Integer> record;

    public RecentCounter() {
        record = new ArrayList<>();
    }

    public int ping(int t) {
        record.add(t);
        return record.size() - find(t - 3000);
    }

    private int find(int target) {
        int left = 0, right = record.size() - 1;
        while (left < right) {
            int mid = (right - left) / 2 + left;
            if (record.get(mid) >= target) {
                right = mid;
            } else {
                left = mid + 1;
            }
        }
        return left;
    }
}

滑動視窗

class RecentCounter {
    private Deque<Integer> record;

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

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

轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/145743.html

標籤：其他

上一篇：CF 1325D Ehab the Xorcist

下一篇：個人定位

0933. Number of Recent Calls (E)

Number of Recent Calls (E)

題目

題意

思路

代碼實作

Java

二分法

滑動視窗