环形链表

最新推荐文章于 2024-08-01 00:32:18 发布

wdsswadjsn

最新推荐文章于 2024-08-01 00:32:18 发布

阅读量1.9k

点赞数

public class Chain
    {
        //Chain proporty
        public string ID;
        public string name;
        public string text;
        public DateTime time;

        //Chain relation
        private object lastObj;
        private object nextObj;

        public object Next
        {
            get{return nextObj;}
            set{nextObj=value;}
        }
        public object Previous
        {
            get{return lastObj;}
            set{this.lastObj=value;}
        }

        public Chain(){}
    }

    public class ChainManager
    {
        int count;
        Chain current;

        public ChainManager(int num)
        {
            Chain fristChain = new Chain();
            Chain chain = fristChain;

            for (int i = 0; i < num-1; i++)
            {
                //chain property
                chain.name = i.ToString();

                //chain relation
                Chain newChain=new Chain();
                chain.Next = newChain;
                newChain.Previous = chain;
                chain = (Chain)chain.Next;
            }
            chain.name = num.tostring();
            chain.Next = fristChain;
            fristChain.Previous = chain;

            this.current = chain;
            this.count = num;
        }

        public void Next()
        {
            current=(Chain)current.Next;
        }
        public void Previous()
        {
            current=(Chain)current.Previous;
        }
        public Chain CurrentChain
        {
            get { return current; }
            set { current = value; }
        }
        public int Count
        {
            get { return count; }
        }
    }
环形链表就能实现我所需要的功能，正向插入，反向查找。对于数据缓存来说还是非常不错的。