c# 栈 简单实现

c# 栈 简单实现

栈是数据 后入先出 原理 直接上代码
class LineStack
{
T[] dataArr;

    public int Count = 0;
    public LineStack()
    {
        dataArr = new T[20];

    }
    public void Push(T data)
    {
        dataArr[Count] = data;
        Count++;


    }

    public T Pop()
    {
        Count--;
        T lastData = dataArr[Count];
       

        return lastData;
    }

    public IEnumerator<T> GetEnumerator()
    {

        for (int i = 0; i < Count; i++)
        {
            yield return dataArr[i];
        }
    }
}

Main 方法调用

       LineStack<int> statck = new LineStack<int>();
        statck.Push(1);
        statck.Push(2);

        Console.WriteLine("1栈长度为：" + statck.Count);

        foreach (var item in statck)
        {
            Console.Write(" " + item);
        }
        Console.WriteLine();
        int popData = statck.Pop();

        Console.WriteLine("2栈长度为：" + statck.Count + " 删除元素为:" + popData);
        Console.ReadKey();