数据结构与算法-3.1顺序队列（C#）

队列是一种特殊的线性表，是一种只允许在表的一端进行插入操作而在另一端进行删除的线性表。

 interface IQueue<T>
    {
        int Count { get; }
        int GetLength();
        bool IsEmpty();
        void Clear();
        void Enqueue(T iteam);
        T Dequeue();
        T Peek();  
    }



class SeqQueue<T> : IQueue<T>
    {
        private T[] data;
        private int count;
        private int front;
        private int rear;
        public SeqQueue(int size)
        {
            data = new T[size];
            count = 0;
            front = -1;
            rear = -1;
        }
        public SeqQueue():this(10)
        {
        } 
        public int Count
        {
            get { return count; }
        }
        public void Clear()
        {
            count = 0;
            front = -1;
            rear = -1;
        }

    public T Dequeue()
    {

        if (count>0)
        {
            T teamp = data[front + 1];
            front++;
            count--;
            return teamp;
        }
        else
        {
            return default(T);
        }
    }
    public void Enqueue(T iteam)
    {
        if (count==data.Length)
        {
            Console.WriteLine("队列已满");
        }
        else
        {
            if (rear==data.Length-1)
            {
                data[0] = iteam;
                rear = 0;
                count++;
            }
            else
            {
                data[rear + 1] = iteam;
                rear++;
                count++;
            }
        }
    }

    public int GetLength()
    {
        return count;
    }

    public bool IsEmpty()
    {
        throw new NotImplementedException();
    }

    public T Peek()
    {
        if (count > 0)
        {
            T teamp = data[front + 1];              
            return teamp;
        }
        else
        {
            return default(T);
        }
    }
}