feat: add solutions to lc problem: No.0933

No.0933.Number of Recent Calls

Author: yanglbme

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

@@ -50,18 +50,18 @@ recentCounter.ping(3002);  // requests = [1, <strong>100</strong>, <strong>3001<
 
 <!-- 这里可写通用的实现逻辑 -->
 
-**方法一：暴力**
-
-使用数组存储所有请求记录，当请求发生时，将记录存入数组，然后遍历数组，统计其中满足 `[t - 3000, t]` 的元素数量，返回即可。
-
-**方法二：队列**
+**方法一：队列**
 
 由题得知，`t` 是**严格递增**的，当一个元素不满足 `[t - 3000, t]` 条件时，在后续的请求当中，它也不可能满足。
 
 对此，需要将其从记录容器中移除，减少无意义的比较。
 
 可以使用队列。每次将 `t` 进入队尾，同时从队头开始，依次移除小于 `t - 3000` 的元素。然后返回队列的大小（`q.size()`）即可。
 
+**方法二：二分查找**
+
+`t` 严格单调递增，非常适合用二分查找来定位 `[t-3000, t]` 的左右边界。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -81,6 +81,22 @@ class RecentCounter:
         return len(self.q)
 
 
+# Your RecentCounter object will be instantiated and called as such:
+# obj = RecentCounter()
+# param_1 = obj.ping(t)
+```
+
+```python
+class RecentCounter:
+
+    def __init__(self):
+        self.s = []
+
+    def ping(self, t: int) -> int:
+        self.s.append(t)
+        return bisect_left(self.s, t + 1) - bisect_left(self.s, t - 3000)
+
+
 # Your RecentCounter object will be instantiated and called as such:
 # obj = RecentCounter()
 # param_1 = obj.ping(t)
@@ -94,10 +110,8 @@ class RecentCounter:
 class RecentCounter {
     private Deque<Integer> q = new ArrayDeque<>();
 
-    public RecentCounter() {
-        
-    }
-    
+    public RecentCounter() {}
+
     public int ping(int t) {
         q.offer(t);
         while (q.peekFirst() < t - 3000) {
@@ -106,6 +120,40 @@ class RecentCounter {
         return q.size();
     }
 }
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */
+```
+
+```java
+class RecentCounter {
+    private int[] s = new int[10010];
+    private int idx;
+
+    public RecentCounter() {
+
+    }
+    
+    public int ping(int t) {
+        s[idx++] = t;
+        return search(t + 1) - search(t - 3000);
+    }
+
+    private int search(int x) {
+        int left = 0, right = idx;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (s[mid] >= x) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}
 
 /**
  * Your RecentCounter object will be instantiated and called as such:
@@ -124,7 +172,7 @@ public:
     RecentCounter() {
 
     }
-    
+
     int ping(int t) {
         q.push(t);
         while (q.front() < t - 3000) q.pop();
@@ -139,6 +187,28 @@ public:
  */
 ```
 
+```cpp
+class RecentCounter {
+public:
+    vector<int> s;
+
+    RecentCounter() {
+
+    }
+    
+    int ping(int t) {
+        s.push_back(t);
+        return lower_bound(s.begin(), s.end(), t + 1) - lower_bound(s.begin(), s.end(), t - 3000);
+    }
+};
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter* obj = new RecentCounter();
+ * int param_1 = obj->ping(t);
+ */
+```
+
 ### **Go**
 
 ```go
@@ -165,6 +235,39 @@ func (this *RecentCounter) Ping(t int) int {
  */
 ```
 
+```go
+type RecentCounter struct {
+	s []int
+}
+
+func Constructor() RecentCounter {
+	return RecentCounter{[]int{}}
+}
+
+func (this *RecentCounter) Ping(t int) int {
+	this.s = append(this.s, t)
+	search := func(x int) int {
+		left, right := 0, len(this.s)
+		for left < right {
+			mid := (left + right) >> 1
+			if this.s[mid] >= x {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		}
+		return left
+	}
+	return search(t+1) - search(t-3000)
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * obj := Constructor();
+ * param_1 := obj.Ping(t);
+ */
+```
+
 ### **JavaScript**
 
 ```js
@@ -200,7 +303,7 @@ public class RecentCounter {
     public RecentCounter() {
 
     }
-    
+
     public int Ping(int t) {
         q.Enqueue(t);
         while (q.Peek() < t - 3000)

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

@@ -61,6 +61,22 @@ class RecentCounter:
         return len(self.q)
 
 
+# Your RecentCounter object will be instantiated and called as such:
+# obj = RecentCounter()
+# param_1 = obj.ping(t)
+```
+
+```python
+class RecentCounter:
+
+    def __init__(self):
+        self.s = []
+
+    def ping(self, t: int) -> int:
+        self.s.append(t)
+        return bisect_left(self.s, t + 1) - bisect_left(self.s, t - 3000)
+
+
 # Your RecentCounter object will be instantiated and called as such:
 # obj = RecentCounter()
 # param_1 = obj.ping(t)
@@ -92,6 +108,41 @@ class RecentCounter {
  */
 ```
 
+```java
+class RecentCounter {
+    private int[] s = new int[10010];
+    private int idx;
+
+    public RecentCounter() {
+
+    }
+    
+    public int ping(int t) {
+        s[idx++] = t;
+        return search(t + 1) - search(t - 3000);
+    }
+
+    private int search(int x) {
+        int left = 0, right = idx;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (s[mid] >= x) {
+                right = mid;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter obj = new RecentCounter();
+ * int param_1 = obj.ping(t);
+ */
+```
+
 ### **C++**
 
 ```cpp
@@ -117,6 +168,28 @@ public:
  */
 ```
 
+```cpp
+class RecentCounter {
+public:
+    vector<int> s;
+
+    RecentCounter() {
+
+    }
+    
+    int ping(int t) {
+        s.push_back(t);
+        return lower_bound(s.begin(), s.end(), t + 1) - lower_bound(s.begin(), s.end(), t - 3000);
+    }
+};
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * RecentCounter* obj = new RecentCounter();
+ * int param_1 = obj->ping(t);
+ */
+```
+
 ### **Go**
 
 ```go
@@ -143,6 +216,39 @@ func (this *RecentCounter) Ping(t int) int {
  */
 ```
 
+```go
+type RecentCounter struct {
+	s []int
+}
+
+func Constructor() RecentCounter {
+	return RecentCounter{[]int{}}
+}
+
+func (this *RecentCounter) Ping(t int) int {
+	this.s = append(this.s, t)
+	search := func(x int) int {
+		left, right := 0, len(this.s)
+		for left < right {
+			mid := (left + right) >> 1
+			if this.s[mid] >= x {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		}
+		return left
+	}
+	return search(t+1) - search(t-3000)
+}
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * obj := Constructor();
+ * param_1 := obj.Ping(t);
+ */
+```
+
 ### **JavaScript**
 
 ```js