interface IlinarList<T>
{
   //插入元素
   void InsertNode(T a, int i);            
   //删除元素
   void DeleteNode(int i);
   //查找表元素
   T SearchNode(int i);
   //定位元素
   T SearchNode(T value);
   //求表长度
   int GetLength();
   //清空操作
   void Clear();
   //判断线性表是否为空
　　bool IsEmpty();
}

public class SeqList<T> : IlinarList<T>
    {
        /// <summary>
        /// 顺序表的最大容量
        /// </summary>
        private int maxsize{get;set;}
        /// <summary>
        /// 数组，存储顺序表中的数据元素
        /// </summary>
        private T[] data;
        /// <summary>
        /// 顺序表的实际长度
        /// </summary>
        private int length { get; set; }

        /// <summary>
        /// 初始化线性表
        /// </summary>
        /// <param name="size"></param>
        public SeqList(int size)
        {
            maxsize = size;
            data = new T[maxsize];
            length = 0;
        }
        //在顺序表的末尾追加数据元素
        public void InsertNode(T a)
        {
            if (IsFull())
            {
                Console.WriteLine("顺序表已满!");
                return;
            }
            data[length] = a;
            length++;
        }
        //在顺序表的第i个数据元素的位置插入一个数据元素
        public void InsertNode(T a, int i)
        {
            if (IsFull())
            {
                Console.WriteLine("顺序表已满!");
                return;
            }
            if (i < 1 || i > length + 1)
            {
                Console.WriteLine("Position is error!");
                return;
            }
            else
            {
                for (int j = length - 1; j >= i - 1; j--)
                {
                    data[j + 1] = data[j];
                }
                data[i - 1] = a;
            }
            length++;
        }
        //删除顺序表的第i个元素
        public void DeleteNode(int i)
        {
            if (IsEmpty())
            {
                Console.WriteLine("顺序表为空!");
                return;
            }
            if (i < 1 || i > length + 1)
            {
                Console.WriteLine("Position is error!");
                return;
            }
            for (int j = i; j < length; j++)
            {
                data[j - 1] = data[j];
            }
            length--;
        }
        //获取顺序表第i个数据元素
        public T SearchNode(int i)
        {
            if (IsEmpty() || (i < 1) || (i > length))
            {
                Console.WriteLine("List is empth or Position is error!");
                return default(T);
            }
            return data[i - 1];
        }
        //在顺序表中查找值为value的数据元素
        public T SearchNode(T value)
        {
            if (IsEmpty())
            {
                Console.WriteLine("List is Empty!");
                return default(T);
            }
            int i = 0;
            for(i=0;i<length;i++)
            {
                if (data[i].ToString().Contains(value.ToString()))
                {
                    break;
                }
            }
            if (i >= length)
            {
                return default(T);
            }
            return data[i];

        }
        //求顺序表的长度
        public int GetLength()
        {
            return length;
        }
        //清空顺序表
        public void Clear()
        {
            length = 0;
        }
        //判断顺序表是否为空
        public bool IsEmpty()
        {
            if (length == 0)
            {
                return true;
            }
            else return false;
        }
        //判断顺序表是否为满
        public bool IsFull()
        {
            if (length == maxsize)
            {
                return true;
            }
            else return false;
        }

    }