LeetBook--队列&栈--循环队列

src/main/java/leet/book/queueStack/MyCircularQueue.java

@@ -0,0 +1,61 @@
+package leet.book.queueStack;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @author: 轩辕龙儿
+ * @date: 2021/7/2 8:44
+ * @Description: No Description
+ */
+public class MyCircularQueue {
+
+    private int[] data;
+    private int front, tail;
+
+    public MyCircularQueue(int k) {
+        data = new int[k + 1];
+        front = 0;
+        tail = 0;
+    }
+
+    public boolean enQueue(int value) {
+        if (isFull()) {
+            return false;
+        } else {
+            data[tail] = value;
+            tail = (tail + 1) % data.length;
+            return true;
+        }
+    }
+
+    public boolean deQueue() {
+        if (isEmpty()) {
+            return false;
+        } else {
+            front = (front + 1) % data.length;
+            return true;
+        }
+    }
+
+    public int Front() {
+        if (isEmpty()) {
+            return -1;
+        }
+        return data[front];
+    }
+
+    public int Rear() {
+        if (isEmpty()) {
+            return -1;
+        }
+        return data[(tail - 1 + data.length) % data.length];
+    }
+
+    public boolean isEmpty() {
+        return front == tail;
+    }
+
+    public boolean isFull() {
+        return (tail + 1) % data.length == front;
+    }
+}