add js soultion for leetcode 933

Author: swiftwind0405

README.md

@@ -37,7 +37,7 @@
 |951|[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/) | |Medium|
 |950|[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/) | |Medium|
 |941|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/) | |Easy|
-|933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | |Easy|
+|933|[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) [js](./algorithms/numberOfRecentCalls/numberOfRecentCallsjs) | |Easy|
 |931|[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/) | |Medium|
 |929|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | |Easy|
 |922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/) | |Easy|

algorithms/numberOfRecentCalls/numberOfRecentCalls.js

@@ -0,0 +1,21 @@
+var RecentCounter = function() {
+    this.q = [];
+};
+
+/** 
+ * @param {number} t
+ * @return {number}
+ */
+RecentCounter.prototype.ping = function(t) {
+    this.q.push(t);
+    while (this.q[0] < t - 3000) {
+        this.q.shift();
+    }
+    return this.q.length;
+};
+
+/**
+ * Your RecentCounter object will be instantiated and called as such:
+ * var obj = new RecentCounter()
+ * var param_1 = obj.ping(t)
+ */