C# 数据结构和算法-数组队列

队列：

队列是一个有序列表,遵循先入先出原则，可以用数组或链表实现

使用场景

用于排队，按顺序执行

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

public static void Main(string[] args) {     ArrayQueue<int> queue = new ArrayQueue<int>(1000);     queue.Push(1);     queue.Push(2);     queue.Push(3);     queue.Push(4);     queue.Push(5);       Console.WriteLine(queue.Pop());     Console.WriteLine(queue.Pop());     queue.Push(6);     queue.Push(7);     queue.Print();     Console.ReadKey(); }

　　数组队列

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54

public class ArrayQueue<T> {     private int _front = -1; //队首     private int _rear = -1; //队尾     private int _maxSize = 0;     private T[] _arr = null;       public ArrayQueue(int maxSize)     {         _maxSize = maxSize;         _arr = new T[maxSize];     }       public bool IsFull()     {         return _rear >= _maxSize - 1;     }       public bool IsEmpty()     {         return _front >= _rear;     }       public void Push(T n)     {         if (this.IsFull())         {             throw new Exception("队列已满");         }         _arr[++_rear] = n;     }       public T Pop()     {         if (this.IsEmpty())         {             throw new Exception("队列已空");         }         return _arr[++_front];     }       public void Print()     {         if (this.IsEmpty())         {             Console.WriteLine("队列已空");             return;         }         for (int i = _front + 1; i <= _rear; i++)         {             Console.WriteLine(i);         }     } }