【LeetCode刷题】- 设计循环队列

Task:

思路：

完全没有思路，相当于学习了，抄几道题

代码：

class MyCircularQueue {
private:
    vector<int> a;
    int max;
    
public:
    /** Initialize your data structure here. Set the size of the queue to be k. */
    MyCircularQueue(int k) {
        max = k;
        
    }
    
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    bool enQueue(int value) {
        if(isFull()){
            return false;
        }else{
            a.push_back(value);
            return true;
        }
    }
    
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    bool deQueue() {
        if(isEmpty()){
            return false;
        }else{
            a.erase(a.begin());
            return true;
        }
        
    }
    
    /** Get the front item from the queue. */
    int Front() {
        if(isEmpty()){
            return -1;
        }else{
            return a.front();
        }
        
    }
    
    /** Get the last item from the queue. */
    int Rear() {
        if(isEmpty()){
            return -1;
        }else{
            int count = a.size();
            return a[count-1];
        }
        
    }
    
    /** Checks whether the circular queue is empty or not. */
    bool isEmpty() {
        if(a.size() == 0)
            return true;
        else
            return false;
        
    }
    
    /** Checks whether the circular queue is full or not. */
    bool isFull() {
        if(a.size() == max)
            return true;
        else
            return false;
        
    }
};

/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue* obj = new MyCircularQueue(k);
 * bool param_1 = obj->enQueue(value);
 * bool param_2 = obj->deQueue();
 * int param_3 = obj->Front();
 * int param_4 = obj->Rear();
 * bool param_5 = obj->isEmpty();
 * bool param_6 = obj->isFull();
 */

提交结果：