2022-5-6 每日一题-leetcode
题目链接:https://leetcode-cn.com/problems/number-of-recent-calls/
个人题解:用队列来维护即可
代码:
class RecentCounter {
public:
queue<int> q;
RecentCounter() {
}
int ping(int t) {
q.push(t);
while(t-q.front()>3000) q.pop();
return q.size();
}
};
结果:


浙公网安备 33010602011771号