[作业] 设计循环双端队列

代码

public class Node{
    public int X;
    public Node Next;
    public Node(int x,Node next)
    {
        X=x;
        Next=next;
    }
}

public class MyCircularDeque {

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

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

思路

单链表设计