solves Number Of Recent Calls

Author: anishLearnsToCode

README.md

@@ -251,7 +251,7 @@
 | 922 | [Sort Array by Parity II](https://leetcode.com/problems/sort-array-by-parity-ii) | [![Java](assets/java.png)](src/SortArrayByParityII.java) |
 | 925 | [Long Pressed Name](https://leetcode.com/problems/long-pressed-name) | [![Java](assets/java.png)](src/LongPressedName.java) |
 | 929 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses) | [![Java](assets/java.png)](src/UniqueEmailAddresses.java) |
-| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | |
+| 933 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls) | [![Java](assets/java.png)](src/NumberOfRecentCalls.java) |
 | 937 | [Reorder Data In Log Files](https://leetcode.com/problems/reorder-data-in-log-files) | |
 | 938 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst) | |
 | 941 | [Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array) | |

src/NumberOfRecentCalls.java

@@ -0,0 +1,32 @@
+public class NumberOfRecentCalls {
+    class RecentCounter {
+        private Node head;
+        private Node tail;
+        private int size = 0;
+
+        public int ping(int t) {
+            size++;
+            if (head == null) {
+                head = new Node(t);
+                tail = head;
+            } else {
+                tail.next = new Node(t);
+                tail = tail.next;
+            }
+            while (head.val < t - 3000) {
+                head = head.next;
+                size--;
+            }
+            return size;
+        }
+
+        private class Node {
+            int val;
+            Node next;
+
+            Node(final int val) {
+                this.val = val;
+            }
+        }
+    }
+}

src/TeemoAttacking.java

@@ -1,9 +1,5 @@
 public class TeemoAttacking {
-    public static void main(String[] args) {
-        System.out.println(findPoisonedDuration(new int[] {1, 2}, 2));
-    }
-
-    public static int findPoisonedDuration(int[] timeSeries, int duration) {
+    public int findPoisonedDuration(int[] timeSeries, int duration) {
         int poisonDuration = 0;
         for (int i = 0, current = timeSeries[0] - 1 ; i < timeSeries.length; i++) {
             poisonDuration += duration - Math.max(0, Math.max(current, timeSeries[i] - 1) - timeSeries[i] + 1);