C# Queue（开发者如何使用）

using System;
using System.Collections.Generic;

class Program
{    
    static void Main()
    {
        // Create a priority queue using a sorted set to store elements in order
        SortedSet<int> priorityQueue = new SortedSet<int>();

        // Add elements to the priority queue
        priorityQueue.Add(30);
        priorityQueue.Add(10);
        priorityQueue.Add(20);

        // Dequeue elements from the priority queue based on their priority
        while (priorityQueue.Count > 0)
        {
            // Access the minimum element (highest priority for this example)
            int element = priorityQueue.Min;
            // Remove the element from the queue
            priorityQueue.Remove(element);
            Console.WriteLine($"Priority Queue Dequeued: {element}");
        }
    }
}

Imports System
Imports System.Collections.Generic

Friend Class Program
	Shared Sub Main()
		' Create a priority queue using a sorted set to store elements in order
		Dim priorityQueue As New SortedSet(Of Integer)()

		' Add elements to the priority queue
		priorityQueue.Add(30)
		priorityQueue.Add(10)
		priorityQueue.Add(20)

		' Dequeue elements from the priority queue based on their priority
		Do While priorityQueue.Count > 0
			' Access the minimum element (highest priority for this example)
			Dim element As Integer = AddressOf priorityQueue.Min
			' Remove the element from the queue
			priorityQueue.Remove(element)
			Console.WriteLine($"Priority Queue Dequeued: {element}")
		Loop
	End Sub
End Class

using System;

// CircularQueue class to implement a fixed-size circular queue
class CircularQueue
{
    private int[] array;
    private int front, rear, size;

    public CircularQueue(int size)
    {
        this.size = size;
        array = new int[size];
        front = rear = -1;
    }

    // Enqueue method to add an element to the circular queue
    public void Enqueue(int item)
    {
        if ((front == 0 && rear == size - 1) || (rear == (front - 1) % (size - 1)))
        {
            Console.WriteLine("Queue is full");
            return;
        }
        else if (front == -1)  // Initial insertion case
        {
            front = rear = 0;
            array[rear] = item;
        }
        else if (rear == size - 1 && front != 0)  // Wrap around
        {
            rear = 0;
            array[rear] = item;
        }
        else  // Normal case
        {
            rear++;
            array[rear] = item;
        }
    }

    // Dequeue method to remove an element from the circular queue
    public int Dequeue()
    {
        if (front == -1)  // Queue is empty case
        {
            Console.WriteLine("Queue is empty");
            return -1;
        }

        int item = array[front];
        array[front] = -1;

        if (front == rear)  // Single element case
            front = rear = -1;
        else if (front == size - 1)  // Wrap around
            front = 0;
        else  // Normal case
            front++;

        return item;
    }
}

class Program
{
    static void Main()
    {
        // Create a circular queue with a specified initial capacity
        CircularQueue circularQueue = new CircularQueue(5);

        // Enqueue elements
        circularQueue.Enqueue(10);
        circularQueue.Enqueue(20);
        circularQueue.Enqueue(30);

        // Dequeue elements
        Console.WriteLine($"Circular Queue Dequeued: {circularQueue.Dequeue()}");
        Console.WriteLine($"Circular Queue Dequeued: {circularQueue.Dequeue()}");
    }
}

Imports System

' CircularQueue class to implement a fixed-size circular queue
Friend Class CircularQueue
	Private array() As Integer
	Private front, rear, size As Integer

	Public Sub New(ByVal size As Integer)
		Me.size = size
		array = New Integer(size - 1){}
'INSTANT VB WARNING: An assignment within expression was extracted from the following statement:
'ORIGINAL LINE: front = rear = -1;
		rear = -1
		front = rear
	End Sub

	' Enqueue method to add an element to the circular queue
	Public Sub Enqueue(ByVal item As Integer)
		If (front = 0 AndAlso rear = size - 1) OrElse (rear = (front - 1) Mod (size - 1)) Then
			Console.WriteLine("Queue is full")
			Return
		ElseIf front = -1 Then ' Initial insertion case
'INSTANT VB WARNING: An assignment within expression was extracted from the following statement:
'ORIGINAL LINE: front = rear = 0;
			rear = 0
			front = rear
			array(rear) = item
		ElseIf rear = size - 1 AndAlso front <> 0 Then ' Wrap around
			rear = 0
			array(rear) = item
		Else ' Normal case
			rear += 1
			array(rear) = item
		End If
	End Sub

	' Dequeue method to remove an element from the circular queue
	Public Function Dequeue() As Integer
		If front = -1 Then ' Queue is empty case
			Console.WriteLine("Queue is empty")
			Return -1
		End If

		Dim item As Integer = array(front)
		array(front) = -1

		If front = rear Then ' Single element case
'INSTANT VB WARNING: An assignment within expression was extracted from the following statement:
'ORIGINAL LINE: front = rear = -1;
			rear = -1
			front = rear
		ElseIf front = size - 1 Then ' Wrap around
			front = 0
		Else ' Normal case
			front += 1
		End If

		Return item
	End Function
End Class

Friend Class Program
	Shared Sub Main()
		' Create a circular queue with a specified initial capacity
		Dim circularQueue As New CircularQueue(5)

		' Enqueue elements
		circularQueue.Enqueue(10)
		circularQueue.Enqueue(20)
		circularQueue.Enqueue(30)

		' Dequeue elements
		Console.WriteLine($"Circular Queue Dequeued: {circularQueue.Dequeue()}")
		Console.WriteLine($"Circular Queue Dequeued: {circularQueue.Dequeue()}")
	End Sub
End Class