队列641、设计循环双端队列

题目

C#代码（老马老师）

public class MyCircularDeque {
    private int pfront;
    private int prear;
    private readonly int[] dataset;
    private int length;
    private int maxsize;
    /** Initialize your data structure here. Set the size of the deque to be k. */
    public MyCircularDeque(int k) {
        dataset=new int[k];
        length=0;
        maxsize=k;
        pfront=0;
        prear=0;
    }
    
    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    public bool InsertFront(int value) {
        if(length==maxsize)
            return false;
        pfront=(pfront-1+maxsize)%maxsize;
        dataset[pfront]=value;
        length++;
        return true;
    }
    
    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    public bool InsertLast(int value) {
        if(length==maxsize)
            return false;
        dataset[prear]=value;
        prear=(prear+1)%maxsize;
        length++;
        return true;
    }
    
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    public bool DeleteFront() {
        if(length==0)
           return false;
        pfront=(pfront+1)%maxsize;
        length--;
        return true;
    }
    
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    public bool DeleteLast() {
        if(length==0)
            return false;
        prear=(prear-1+maxsize)%maxsize;
        length--;
        return true;
    }
    
    /** Get the front item from the deque. */
    public int GetFront() {
        if(length==0)
            return -1;
            return dataset[pfront];
    }
    
    /** Get the last item from the deque. */
    public int GetRear() {
         if(length==0)
            return -1;
        int index=(prear-1+maxsize)%maxsize;
        return dataset[index];
    }
    
    /** Checks whether the circular deque is empty or not. */
    public bool IsEmpty() {
        return length==0;
    }
    
    /** Checks whether the circular deque is full or not. */
    public bool IsFull() {
        return length==maxsize;
    }
}

/**
 * Your MyCircularDeque object will be instantiated and called as such:
 * MyCircularDeque obj = new MyCircularDeque(k);
 * bool param_1 = obj.InsertFront(value);
 * bool param_2 = obj.InsertLast(value);
 * bool param_3 = obj.DeleteFront();
 * bool param_4 = obj.DeleteLast();
 * int param_5 = obj.GetFront();
 * int param_6 = obj.GetRear();
 * bool param_7 = obj.IsEmpty();
 * bool param_8 = obj.IsFull();
 */