\u5faa\u73af\u961f\u5217 (Circular Queue) \u7684\u5b9e\u73b0，\u5e76\u8981\u6c42\u8fdb\u884c\u5bf9\u6bd4\u3002\u7ed3\u5408\u4e0a\u4e0b\u6587，\u6211\u5047\u8bbe\u60a8\u5e0c\u671b\u5c06\u5faa\u73af\u961f\u5217\u4e0e\u5176\u4ed6\u76f8\u5173\u6570\u636e\u7ed3\u6784（\u5982\u5355\u94fe\u8868\u3001\u53cc\u94fe\u8868\u3001\u6570\u7ec4\u5217\u8868\u3001\u6808\u3001\u666e\u901a\u961f\u5217\u7b49）\u8fdb\u884c\u5bf9\u6bd4，\u7279\u522b\u662f\u5728\u6027\u80fd\u3001\u9002\u7528\u573a\u666f\u548c\u534a\u5bfc\u4f53\u4ea7\u7ebf\u5e94\u7528\u65b9\u9762\u3002\u4ee5\u4e0b\u6211\u5c06：<\/p>\n
\u5982\u679c\u60a8\u6709\u7279\u5b9a\u7684\u5bf9\u6bd4\u5bf9\u8c61\u6216\u573a\u666f\u8981\u6c42（\u4f8b\u5982\u53ea\u4e0e\u5355\u94fe\u8868\u5bf9\u6bd4，\u6216\u805a\u7126\u7279\u5b9a\u64cd\u4f5c），\u8bf7\u8fdb\u4e00\u6b65\u8bf4\u660e，\u6211\u5c06\u8c03\u6574\u5185\u5bb9\u4ee5\u66f4\u7cbe\u51c6\u5730\u6ee1\u8db3\u60a8\u7684\u9700\u6c42！<\/p>\n
\u4e00\u3001\u5faa\u73af\u961f\u5217\u5b9e\u73b0\u56de\u987e\u5faa\u73af\u961f\u5217\u662f\u4e00\u79cd\u57fa\u4e8e\u6570\u7ec4\u7684\u961f\u5217\u5b9e\u73b0，\u901a\u8fc7\u5faa\u73af\u7d22\u5f15（\u6a21\u8fd0\u7b97）\u590d\u7528\u6570\u7ec4\u7a7a\u95f4，\u907f\u514d\u666e\u901a\u961f\u5217\u524d\u7aef\u7a7a\u95f4\u6d6a\u8d39\u3002<\/p>\n
\u4ee5\u4e0b\u662f\u7b80\u5316\u7684\u5faa\u73af\u961f\u5217\u5b9e\u73b0（\u57fa\u4e8e\u524d\u6587，\u7cbe\u7b80\u4ee5\u805a\u7126\u5bf9\u6bd4）：csharp<\/p>\n
\u00a0<\/p>\n
public class CircularQueue<T>
\n{
\n private T[] items;
\n private int front, rear, size, capacity;<\/p>\n
public CircularQueue(int initialCapacity)
\n {
\n capacity = initialCapacity;
\n items = new T[capacity];
\n front = 0;
\n rear = -1;
\n size = 0;
\n }<\/p>\n
public int Count => size;
\n public bool IsEmpty => size == 0;
\n public bool IsFull => size == capacity;<\/p>\n
public void Enqueue(T item)
\n {
\n if (IsFull) Resize(capacity * 2);
\n rear = (rear + 1) % capacity;
\n items[rear] = item;
\n size++;
\n }<\/p>\n
public T Dequeue()
\n {
\n if (IsEmpty) throw new InvalidOperationException("Queue is empty");
\n T item = items[front];
\n items[front] = default;
\n front = (front + 1) % capacity;
\n size–;
\n if (size > 0 && size <= capacity \/ 4) Resize(capacity \/ 2);
\n return item;
\n }<\/p>\n
public T Peek()
\n {
\n if (IsEmpty) throw new InvalidOperationException("Queue is empty");
\n return items[front];
\n }<\/p>\n
private void Resize(int newCapacity)
\n {
\n T[] newItems = new T[newCapacity];
\n for (int i = 0; i < size; i++)
\n newItems[i] = items[(front + i) % capacity];
\n items = newItems;
\n front = 0;
\n rear = size – 1;
\n capacity = newCapacity;
\n }
\n}<\/p>\n
\u5173\u952e\u7279\u70b9：<\/p>\n
\u4e8c\u3001\u5faa\u73af\u961f\u5217\u4e0e\u5176\u4ed6\u6570\u636e\u7ed3\u6784\u7684\u5bf9\u6bd4\u4ee5\u4e0b\u5c06\u5faa\u73af\u961f\u5217\u4e0e \u5355\u94fe\u8868\u3001\u53cc\u94fe\u8868\u3001\u6570\u7ec4\u5217\u8868\u3001\u6808 \u548c \u666e\u901a\u961f\u5217 \u8fdb\u884c\u5bf9\u6bd4，\u6db5\u76d6\u6027\u80fd\u3001\u5b9e\u73b0\u590d\u6742\u5ea6\u548c\u9002\u7528\u573a\u666f\u3002<\/p>\n
1. \u5bf9\u6bd4\u7ef4\u5ea6<\/p>\n
2. \u5bf9\u6bd4\u8868\u683c<\/p>\n
| \n \u5faa\u73af\u961f\u5217<\/p>\n<\/td>\n | \n O(1)（\u5c3e\u90e8）<\/p>\n<\/td>\n | \n O(1)（\u5934\u90e8）<\/p>\n<\/td>\n | \n O(1)（\u5934\u90e8）<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u9ad8（\u5faa\u73af\u590d\u7528）<\/p>\n<\/td>\n | \n \u4e2d\u7b49<\/p>\n<\/td>\n | \n \u4efb\u52a1\u8c03\u5ea6\u3001\u7f13\u51b2\u533a\u7ba1\u7406<\/p>\n<\/td>\n<\/tr>\n |
| \n \u5355\u94fe\u8868<\/p>\n<\/td>\n | \n O(1)\/O(n)<\/p>\n<\/td>\n | \n O(1)\/O(n)<\/p>\n<\/td>\n | \n O(n)\/O(1, O(n))<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u4e2d（\u52a8\u6001\u5206\u914d）<\/p>\n<\/td>\n | \n \u4f4e<\/p>\n<\/td>\n | \n \u52a8\u6001\u5217\u8868\u3001\u987a\u5e8f\u904d\u5386<\/p>\n<\/td>\n<\/tr>\n |
| \n \u53cc\u94fe\u8868<\/p>\n<\/td>\n | \n O(1)\/O(1)<\/p>\n<\/td>\n | \n O(1)\/O(1)<\/p>\n<\/td>\n | \n O(n)\/O(1)<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u4e2d（\u52a8\u6001\u5206\u914d）<\/p>\n<\/td>\n | \n \u4e2d\u7b49<\/p>\n<\/td>\n | \n \u53cc\u5411\u904d\u5386\u3001\u52a8\u6001\u5217\u8868<\/p>\n<\/td>\n<\/tr>\n |
| \n \u6570\u7ec4\u5217\u8868<\/p>\n<\/td>\n | \n O(1)（\u5c3e\u90e8, \u5747\u644a）<\/p>\n<\/td>\n | \n O(n)（\u5934\u90e8\/\u5c3e\u90e8）<\/p>\n<\/td>\n | \n O(1)（\u968f\u673a）<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u9ad8（\u8fde\u7eed\u5185\u5b58）<\/p>\n<\/td>\n | \n \u4f4e<\/p>\n<\/td>\n | \n \u968f\u673a\u8bbf\u95ee\u3001\u52a8\u6001\u5217\u8868<\/p>\n<\/td>\n<\/tr>\n |
| \n \u6808<\/p>\n<\/td>\n | \n O(1)（\u9876\u90e8, \u5747\u644a）<\/p>\n<\/td>\n | \n O(1)（\u9876\u90e8）<\/p>\n<\/td>\n | \n O(1)（\u9876\u90e8）<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u9ad8（\u8fde\u7eed\u5185\u5b58）<\/p>\n<\/td>\n | \n \u4f4e<\/p>\n<\/td>\n | \n LIFO\u3001\u64a4\u9500\u64cd\u4f5c<\/p>\n<\/td>\n<\/tr>\n |
| \n \u666e\u901a\u961f\u5217<\/p>\n<\/td>\n | \n O(1)（\u5c3e\u90e8, \u5747\u644a）<\/p>\n<\/td>\n | \n O(1)（\u5934\u90e8）<\/p>\n<\/td>\n | \n O(1)（\u5934\u90e8）<\/p>\n<\/td>\n | \n O(n)<\/p>\n<\/td>\n | \n \u4f4e（\u524d\u7aef\u6d6a\u8d39）<\/p>\n<\/td>\n | \n \u4f4e<\/p>\n<\/td>\n | \n \u7b80\u5355\u4efb\u52a1\u8c03\u5ea6<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n 3. \u8be6\u7ec6\u5bf9\u6bd4\u5206\u6790(1) \u5faa\u73af\u961f\u5217 vs \u5355\u94fe\u8868<\/p>\n
|