feat: add python and java solutions to leetcode problem: No.0933

See https://leetcode-cn.com/problems/number-of-recent-calls/submissions

Author: yanglbme

README.md

@@ -98,6 +98,7 @@
 1. [用栈实现队列](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README.md)
 1. [用队列实现栈](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README.md)
 1. [逆波兰表达式求值](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README.md)
+1. [最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md)
 
 ### 动态规划
 

README_EN.md

@@ -93,6 +93,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 1. [Implement Queue using Stacks](/solution/0200-0299/0232.Implement%20Queue%20using%20Stacks/README_EN.md)
 1. [Implement Stack using Queues](/solution/0200-0299/0225.Implement%20Stack%20using%20Queues/README_EN.md)
 1. [Evaluate Reverse Polish Notation](/solution/0100-0199/0150.Evaluate%20Reverse%20Polish%20Notation/README_EN.md)
+1. [Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md)
 
 ### Dynamic Programming
 

solution/0900-0999/0933.Number of Recent Calls/README.md

@@ -40,20 +40,60 @@
 
 <!-- tabs:start -->
 
+在第 1、100、3001、3002 这四个时间点分别进行了 ping 请求， 在 3001 秒的时候， 它前面的 3000 秒指的是区间 `[1,3001]`， 所以一共是有 `1、100、3001` 三个请求， t = 3002 的前 3000 秒指的是区间 `[2,3002]`, 所以有 `100、3001、3002` 三次请求。
+
+可以用队列实现。每次将 t 进入队尾，同时从队头开始依次移除小于 `t-3000` 的元素。然后返回队列的大小 `q.size()` 即可。
+
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class RecentCounter:
+
+    def __init__(self):
+        self.q = []
+
 
+    def ping(self, t: int) -> int:
+        self.q.append(t)
+        while self.q[0] < t - 3000:
+            self.q.pop(0)
+        return len(self.q)
+
+
+# Your RecentCounter object will be instantiated and called as such:
+# obj = RecentCounter()
+# param_1 = obj.ping(t)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class RecentCounter {
+
+    private Deque<Integer> q;
+
+    public RecentCounter() {
+        q = new ArrayDeque<>();
+    }
+
+    public int ping(int t) {
+        q.offerLast(t);
+        while (q.peekFirst() < t - 3000) {
+            q.pollFirst();
+        }
+        return q.size();
+    }
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */
 ```
 
 ### **...**

solution/0900-0999/0933.Number of Recent Calls/README_EN.md

@@ -47,13 +47,49 @@
 ### **Python3**
 
 ```python
+class RecentCounter:
 
+    def __init__(self):
+        self.q = []
+
+
+    def ping(self, t: int) -> int:
+        self.q.append(t)
+        while self.q[0] < t - 3000:
+            self.q.pop(0)
+        return len(self.q)
+
+
+# Your RecentCounter object will be instantiated and called as such:
+# obj = RecentCounter()
+# param_1 = obj.ping(t)
 ```
 
 ### **Java**
 
 ```java
-
+class RecentCounter {
+
+    private Deque<Integer> q;
+
+    public RecentCounter() {
+        q = new ArrayDeque<>();
+    }
+
+    public int ping(int t) {
+        q.offerLast(t);
+        while (q.peekFirst() < t - 3000) {
+            q.pollFirst();
+        }
+        return q.size();
+    }
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */
 ```
 
 ### **...**

solution/0900-0999/0933.Number of Recent Calls/Solution.java

@@ -0,0 +1,22 @@
+class RecentCounter {
+
+    private Deque<Integer> q;
+
+    public RecentCounter() {
+        q = new ArrayDeque<>();
+    }
+    
+    public int ping(int t) {
+        q.offerLast(t);
+        while (q.peekFirst() < t - 3000) {
+            q.pollFirst();
+        }
+        return q.size();
+    }
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */

solution/0900-0999/0933.Number of Recent Calls/Solution.py

@@ -0,0 +1,16 @@
+class RecentCounter:
+
+    def __init__(self):
+        self.q = []
+
+
+    def ping(self, t: int) -> int:
+        self.q.append(t)
+        while self.q[0] < t - 3000:
+            self.q.pop(0)
+        return len(self.q)
+
+
+# Your RecentCounter object will be instantiated and called as such:
+# obj = RecentCounter()
+# param_1 = obj.ping(t)