C#--循环队列的顺序存储

最新推荐文章于 2023-01-21 10:08:33 发布

powerx_yc

最新推荐文章于 2023-01-21 10:08:33 发布

阅读量199

点赞数

CC 4.0 BY-SA版权

文章标签： c# python

原文链接：https://my.oschina.net/mojiadan/blog/117975

本文介绍如何使用C#语言实现循环队列的基本操作，包括插入、删除和显示队列元素，通过实例演示循环队列的应用。

2019独角兽企业重金招聘Python工程师标准>>>

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace ConsoleApplication2
{  //循环队列的顺序存储
    public class Queue
    {
        public int front { get; set; }
        public int rear { get; set; }
        public string[] data { get; set; }
        public int maxsize;
        /// <summary>
        /// 构造函数，初始化队列长度
        /// </summary>
        /// <param name="maxsize"></param>
        public Queue(int maxsize)
        {
            this.front = 0;
            this.rear = 0;
            this.maxsize = maxsize;
            this.data = new string[maxsize];
        }
        /// <summary>
        /// 返回队列长度
        /// </summary>
        /// <returns></returns>
        public int QueueLength()
        {

            return (this.rear - this.front + maxsize) % maxsize;
        }
        /// <summary>
        /// 插入队列节点
        /// </summary>
        /// <param name="queueNode"></param>
        public void InsertQueueNode(string queueNode)
        {
            if ((this.rear + 1) % this.maxsize == this.front)
                return;
            this.data[this.rear] = queueNode;
            this.rear = (this.rear + 1) % this.maxsize;
        }
        /// <summary>
        /// 删除一个节点
        /// </summary>
        public void DeleteQueueNode()
        {
            if (this.rear == this.front)
            {
                return;
            }
            this.front = (this.front + 1) % this.maxsize;
        }
        /// <summary>
        /// 显示队列
        /// </summary>
        public void ShowQueue()
        {
            if (this.rear == this.front)
            {
                return;
            }
            while((this.front+1)%this.maxsize!=this.rear){

                Console.WriteLine(this.data[this.front]);
                this.front=(this.front+1)%this.maxsize;
            }
            Console.WriteLine(this.data[this.front]);
        }
    }


    //测试
    class Program
    {
        static void Main(string[] args)
        {
            Queue queue = new Queue(8);
            queue.InsertQueueNode("0");
            queue.InsertQueueNode("1");
            queue.InsertQueueNode("2");
            queue.InsertQueueNode("3");
            queue.InsertQueueNode("4");
            queue.InsertQueueNode("5");
        //    queue.DeleteQueueNode();
            queue.ShowQueue();
            Console.ReadKey();
        }
    }

}

转载于:https://my.oschina.net/mojiadan/blog/117975