C# 数据结构与算法 - 线性表

    interface IlistDS<T>
    {
        int GetLength();
        void Clear();
        bool IsEmpty();
        void Add(T item);
        void Insert(T item, int index);
        T Delete(int index);
        T this[int index] { get; }
        T GetEle(int index);
        int Locat(T item);
    }

    /// <summary>
    /// 顺序表实现方式
    /// </summary>
    /// <typeparam name="T"></typeparam>
    class SeqList<T> : IlistDS<T>
    {
        private T[] data;
        private int count = 0;

        public SeqList(int Size)//Size就是最大容量
        {
            data = new T[Size];
        }
        public SeqList():this(10)//默认构造函数，长度为10
        {
        }


        public T this[int index]
        {
            get
            {
                return GetEle(index);
            }
        }

        /// <summary>
        /// 添加数据
        /// </summary>
        /// <param name="item"></param>
        public void Add(T item)
        {
            if (count == data.Length)
            {
                Console.WriteLine("当前顺序表已经存满，不允许再存");
            }
            else
            {
                data[count++] = item;
            }
        }

        public void Clear()
        {
            count = 0;
        }

        public T Delete(int index)
        {
            T item = data[index];
            for (int i = index; i <= count - 1; i++)
            {
                data[i] = data[i + 1];
            }
            count--;
            return item; 
        }

        public T GetEle(int index)
        {
            if (index >= 0 && index <= count - 1)
            {
                return data[index];
            }
            else
            {
                Console.WriteLine("索引不存在");
                return default(T);
            }
        }

        /// <summary>
        /// 取得数据的个数
        /// </summary>
        /// <param name="index"></param>
        /// <returns></returns>
        public int GetLength()
        {
            return count;
        }

        public void Insert(T item, int index)
        {
            for (int i = count - 1; i >= index; i--)
            {
                data[i+1] = data[i];
            }
            data[index] = item;
            count++;
        }

        public bool IsEmpty()
        {
            return count == 0;
        }

        public int Locat(T item)
        {
            for (int i = 0; i < count; i++)
            {
                if (data[i].Equals(item))
                    return i;
            }
            return -1;
        }
    }

        static void Main(string[] args)
        {
            //使用自己的顺序表
            SeqList<string> seqList = new SeqList<string>();

            seqList.Add("123");
            seqList.Add("456");
            seqList.Add("789");

            Console.WriteLine(seqList.GetEle(0));
            Console.WriteLine(seqList[0]);

            seqList.Insert("777",1);
            for (int i = 0; i < seqList.GetLength(); i++)
            {
                Console.Write(seqList[i] + "  ");
            }
            Console.WriteLine();


            seqList.Delete(0);
            for (int i = 0; i < seqList.GetLength(); i++)
            {
                Console.Write(seqList[i] + "  ");
            }
            Console.WriteLine();

            seqList.Clear();
            Console.WriteLine(seqList.GetLength());

            Console.ReadKey();
        }