【LeetCode】循环双端队列

超、凢脫俗 2021-11-11 09:54 400阅读 0赞

##### Java code #####

class MyCircularDeque {
        
        private int front;
        private int rear;
        private int size;
        private int[] arr;
        private int maxSize;
        
        public MyCircularDeque(int k) {
        
            front = 0;
            rear = 0;
            size = 0;
            maxSize = k;
            arr = new int[maxSize];
        }
        
        public boolean insertFront(int value) {
        
            if(isFull()) {
        
                return false;
            }
            front = (front - 1 + maxSize) % maxSize;
            arr[front] = value;
            size++;
            return true;
        }
        
        public boolean insertLast(int value) {
        
            if(isFull()) {
        
                return false;
            }
            arr[rear] = value;
            rear = (rear + 1) % maxSize;
            size++;
            return true;
        }
        
        public boolean deleteFront() {
        
            if(isEmpty()) {
        
                return false;
            }
            front = (front + 1) % maxSize;
            size--;
            return true;
        }
        
        public boolean deleteLast() {
        
            if(isEmpty()) {
        
                return false;
            }
            rear = (rear - 1 + maxSize) % maxSize;
            size--;
            return true;
        }
        
        public int getFront() {
        
            if(isEmpty()) {
        
                return -1;
            }
            return arr[front];
        }
        
        public int getRear() {
        
            if(isEmpty()) {
        
                return -1;
            }
            return arr[(rear - 1 + maxSize) % maxSize];
        }
        
        public boolean isEmpty() {
        
            if(size > 0) {
        
                return false;
            }
            return true;
        }
        
        public boolean isFull() {
        
            return size == maxSize;
        }
    }

##### 提交记录 #####

![提交记录][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM3MDQzMTAw_size_16_color_FFFFFF_t_70]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM3MDQzMTAw_size_16_color_FFFFFF_t_70]: /images/20211109/818b513ad9c04945ae42098fd3fb8924.png