add 622

Author: fishercoder1534

README.md

@@ -591,6 +591,7 @@ _If you like this project, please leave me a star._ ★
 |625|[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_625.java) |  |Medium | 
 |624|[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) |  |Easy | Sort, Array
 |623|[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_623.java) | |Medium | Tree
+|622|[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_622.java) |  |Medium | Design, Queue
 |621|[Task Scheduler](https://leetcode.com/problems/task-scheduler/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_621.java) |  |Medium | Greedy, Queue
 |617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) |  |Easy | Tree, Recursion
 |616|[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) | | Medium | String 

src/main/java/com/fishercoder/solutions/_622.java

@@ -0,0 +1,60 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _622 {
+    public static class Solution1 {
+        public static class MyCircularQueue {
+
+            int[] arr;
+            int rearIndex;//this one points to the rear of the queue and could grow to 3000 which is the max calls that this problem is bound to
+            int size;//this is the max size of this circule queue
+            int frontIndex;
+
+            public MyCircularQueue(int k) {
+                arr = new int[k];
+                Arrays.fill(arr, -1);
+                size = k;
+                rearIndex = 0;
+                frontIndex = 0;
+            }
+
+            public boolean enQueue(int value) {
+                if (arr[rearIndex % size] == -1) {
+                    arr[rearIndex % size] = value;
+                    rearIndex++;
+                    return true;
+                } else {
+                    return false;
+                }
+            }
+
+            public boolean deQueue() {
+                if (arr[frontIndex % size] != -1) {
+                    arr[frontIndex % size] = -1;
+                    frontIndex++;
+                    return true;
+                } else {
+                    return false;
+                }
+            }
+
+            public int Front() {
+                return arr[frontIndex % size];
+            }
+
+            public int Rear() {
+                return arr[(rearIndex - 1) % size];
+            }
+
+            public boolean isEmpty() {
+                return rearIndex == frontIndex;
+            }
+
+            public boolean isFull() {
+                return Math.abs(rearIndex - frontIndex) == size;
+            }
+        }
+
+    }
+}

src/test/java/com/fishercoder/_622Test.java

@@ -0,0 +1,25 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._622;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _622Test {
+    private static _622.Solution1.MyCircularQueue myCircularQueue;
+
+    @Test
+    public void test1() {
+        myCircularQueue = new _622.Solution1.MyCircularQueue(3);
+        assertEquals(true, myCircularQueue.enQueue(1));
+        assertEquals(true, myCircularQueue.enQueue(2));
+        assertEquals(true, myCircularQueue.enQueue(3));
+        assertEquals(false, myCircularQueue.enQueue(4));
+        assertEquals(3, myCircularQueue.Rear());
+        assertEquals(true, myCircularQueue.isFull());
+        assertEquals(true, myCircularQueue.deQueue());
+        assertEquals(true, myCircularQueue.enQueue(4));
+        assertEquals(4, myCircularQueue.Rear());
+    }
+
+}