【刷leetcode，拿Offer-022】933. Number of Recent Calls

题目链接：933. Number of Recent Calls

题面：

933. Number of Recent Calls

Easy

133647FavoriteShare

Write a class RecentCounter to count recent requests.

It has only one method: ping(int t), where t represents some time in milliseconds.

Return the number of pings that have been made from 3000 milliseconds ago until now.

Any ping with time in [t - 3000, t] will count, including the current ping.

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

 

Example 1:

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

 

Note:

1. Each test case will have at most 10000 calls to ping.
2. Each test case will call ping with strictly increasing values of t.
3. Each call to ping will have 1 <= t <= 10^9.

题意：计算给定的当前的时间往前3000个单位内的通话数。

解题：注意一下值是严格递增的，可以保留一下当前下标做个优化，找到第一个，然后减一下得出大小。（可以用二分优化，此处没有什么必要）。

代码：

class RecentCounter {
public:
    vector <int> v;
    int cur;
    RecentCounter() {
        cur=0;
    }
    int ping(int t) {
        int ans=0;
        v.push_back(t);
        for(int i=cur;i<=v.size();i++){
            if(v[i]>=t-3000){
                cur=i;
                ans=v.size()-cur;
                break;
            }
        }
        return ans;
    }
};

/**
 * Your RecentCounter object will be instantiated and called as such:
 * RecentCounter* obj = new RecentCounter();
 * int param_1 = obj->ping(t);
 */