循环队列oj

- 日理万妓 2023-10-02 13:06 35阅读 0赞

题目内容：

![watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAb2hhbmHvvIE_size_20_color_FFFFFF_t_70_g_se_x_16][]

解题代码：

class MyCircularQueue {
        int[] array;
        int front = 0;
        int rear = 0;
        int count = 0;
    
        public MyCircularQueue(int k) {
            array = new int[k];
        }
        
        public boolean enQueue(int value) {
            if(isFull()){
                return false;
            }
    
            array[rear] = value;
            rear++;
            count++;
            if(rear == array.length){
                rear = 0;
            }
    
            return true;
        }
        
        public boolean deQueue() {
            if(isEmpty()){
                return false;
            }
    
            
            front++;
            if(front == array.length){
                front = 0;
            }
    
            count--;
            return true;
        }
        
        public int Front() {
            if(isEmpty()){
                return -1;
            }
    
            return array[front];
        }
        
        public int Rear() {
            if(isEmpty()){
                return -1;
            }
            
            int m = ((rear - 1 + array.length) % array.length);
            return array[m];
        }
        
        public boolean isEmpty() {
            if(count == 0){
                return true;
            }
            return false;
        }
        
        public boolean isFull() {
            if(count == array.length){
                return true;
            }
    
            return false;
        }
    }

[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAb2hhbmHvvIE_size_20_color_FFFFFF_t_70_g_se_x_16]: https://img-blog.csdnimg.cn/f0e8764ae6a341b18005a9a1c0b45f21.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAb2hhbmHvvIE=,size_20,color_FFFFFF,t_70,g_se,x_16