力扣之设计循环双端队列——641

问题

解答

数据结构队列知识

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

/**
 * 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();
 */

调试结果：