題目

https://leetcode.com/problems/design-circular-deque/

題解

相關問題：leetcode 622. Design Circular Queue | 622. 設計循環隊列（Ring Buffer）

class MyCircularDeque {int[] queue;int N; // 隊列容量int front = 0; // 下一個有值的位置int rear = 0; // 下一個空位置(插入時rear++)int size = 0; // 已經裝了的容量public MyCircularDeque(int k) {queue = new int[k];N = k;}public boolean insertFront(int value) {if (size == queue.length) return false;front--;if (front < 0) front += N;queue[front] = value;size++;return true;}public boolean insertLast(int value) {if (size == queue.length) return false;queue[rear++] = value;rear %= N;size++;return true;}public boolean deleteFront() {if (size == 0) return false;front++;front %= N;size--;return true;}public boolean deleteLast() {if (size == 0) return false;rear--;if (rear < 0) rear += N;size--;return true;}public int getFront() { // peek frontif (size == 0) return -1;return queue[front];}public int getRear() { // peek rearif (size == 0) return -1;return queue[(rear - 1 + N) % N];}public boolean isEmpty() {return size == 0;}public boolean isFull() {return size == N;} }/*** Your MyCircularDeque object will be instantiated and called as such:* MyCircularDeque obj = new MyCircularDeque(k);* boolean param_1 = obj.insertFront(value);* boolean param_2 = obj.insertLast(value);* boolean param_3 = obj.deleteFront();* boolean param_4 = obj.deleteLast();* int param_5 = obj.getFront();* int param_6 = obj.getRear();* boolean param_7 = obj.isEmpty();* boolean param_8 = obj.isFull();*/

總結

以上是生活随笔為你收集整理的leetcode 622. Design Circular Queue | 641. 设计循环双端队列（Java）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。