#region 栈的数据结构     /// <summary> /// 栈的数据结构 /// </summary>     public class seqstack<t>     {         public t[] data,

  。

        /// <summary> /// 栈顶指针 /// </summary>         public int top = -1,

        public seqstack(int lenth)         {             data = new t[lenth];         }     }     #endregion 。

#region 栈的初始化操作         /// <summary> /// 栈的初始化操作 /// </summary> /// <typeparam name="t"></typeparam> /// <returns></returns>         public seqstack<t> seqstackinit<t>(int length)         {             seqstack<t> seqstack = new seqstack<t>(length),

  。

            seqstack.top = -1,

            return seqstack;         }         #endregion 。

#region 入栈         /// <summary> /// 入栈 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <param name="data"></param>         public void seqstackpush<t>(seqstack<t> seqstack, t data)         {             if (seqstackisfull(seqstack))                 throw new exception("不好意思，栈溢出"),

  。

            seqstack.data[++seqstack.top] = data;         }         #endregion 。

#region 出栈         /// <summary> /// 出栈 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public t seqstackpop<t>(seqstack<t> seqstack)         {             if (seqstackisempty(seqstack))                 throw new exception("呜呜，栈已空"),

  。

            seqstack.data[seqstack.top] = default(t),

            return seqstack.data[--seqstack.top];         }         #endregion 。

#region 获取栈顶         /// <summary> /// 获取栈顶 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public t seqstackpeek<t>(seqstack<t> seqstack)         {             if (seqstackisempty(seqstack))                 throw new exception("栈已空"),

  。

            return seqstack.data[seqstack.top];         }         #endregion 。

using system; using system.collections.generic; using system.linq; using system.text,

  。

namespace seqstack {     class program     {         static void main(string[] args)         {             seqstackclass stackmanager = new seqstackclass(),

            seqstack<student> seqstack = stackmanager.seqstackinit<student>(10),

            console.writeline("********************  压入id=1,id=2,id=3的元素  ***********************\n");             //压入id=1,id=2,id=3的元素             stackmanager.seqstackpush(seqstack, new student() { id = 1, name = "一线码农", age = 23 });             stackmanager.seqstackpush(seqstack, new student() { id = 2, name = "huangxincheng520", age = 23 });             stackmanager.seqstackpush(seqstack, new student() { id = 3, name = "51cto", age = 23 }),

            console.writeline(".... 压入成功，当前栈中元素有：" + stackmanager.seqstacklen(seqstack) + "个"),

            console.writeline("\n******************  查看栈顶元素  ********************"),

            var result = stackmanager.seqstackpeek(seqstack),

            console.writeline("栈顶元素为：id=" + result.id + ",name=" + result.name + ",age=" + result.age),

            console.writeline("\n********************  弹出栈顶元素  ***********************"),

            stackmanager.seqstackpop(seqstack),

            console.writeline("\n******************  查看栈中的元素  ********************"),

            for (int i = 0; i < stackmanager.seqstacklen(seqstack); i++)             {                 console.writeline("栈顶元素为：id=" + seqstack.data[i].id + ",name=" + seqstack.data[i].name + ",age=" + seqstack.data[i].age);             } 。

            console.read();         }     } 。

    #region 学生数据实体     /// <summary> /// 学生数据实体 /// </summary>     public class student     {         public int id { get; set; } 。

        public string name { get; set; } 。

        public int age { get; set; }     }     #endregion 。

    #region 栈的数据结构     /// <summary> /// 栈的数据结构 /// </summary>     public class seqstack<t>     {         public t[] data,

        /// <summary> /// 栈顶指针 /// </summary>         public int top = -1,

        public seqstack(int lenth)         {             data = new t[lenth];         }     }     #endregion 。

    public class seqstackclass     {         #region 栈的初始化操作         /// <summary> /// 栈的初始化操作 /// </summary> /// <typeparam name="t"></typeparam> /// <returns></returns>         public seqstack<t> seqstackinit<t>(int length)         {             seqstack<t> seqstack = new seqstack<t>(length),

            seqstack.top = -1,

            return seqstack;         }         #endregion 。

        #region 判断栈是否为空         /// <summary> /// 判断栈是否为空 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public bool seqstackisempty<t>(seqstack<t> seqstack)         {             return seqstack.top == -1;         }         #endregion 。

        #region 清空栈         /// <summary> /// 清空栈 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param>         public void seqstackclear<t>(seqstack<t> seqstack)         {             seqstack.top = -1;         }         #endregion 。

        #region 栈是否已满         /// <summary> /// 栈是否已满 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param>         public bool seqstackisfull<t>(seqstack<t> seqstack)         {             return seqstack.top == seqstack.data.length;         }         #endregion 。

        #region 入栈         /// <summary> /// 入栈 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <param name="data"></param>         public void seqstackpush<t>(seqstack<t> seqstack, t data)         {             if (seqstackisfull(seqstack))                 throw new exception("不好意思，栈溢出"),

            seqstack.data[++seqstack.top] = data;         }         #endregion 。

        #region 出栈         /// <summary> /// 出栈 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public t seqstackpop<t>(seqstack<t> seqstack)         {             if (seqstackisempty(seqstack))                 throw new exception("呜呜，栈已空"),

            seqstack.data[seqstack.top] = default(t),

            return seqstack.data[--seqstack.top];         }         #endregion 。

        #region 获取栈顶         /// <summary> /// 获取栈顶 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public t seqstackpeek<t>(seqstack<t> seqstack)         {             if (seqstackisempty(seqstack))                 throw new exception("栈已空"),

            return seqstack.data[seqstack.top];         }         #endregion 。

        #region 获取栈中元素个数         /// <summary> /// 获取栈中元素个数 /// </summary> /// <typeparam name="t"></typeparam> /// <param name="seqstack"></param> /// <returns></returns>         public int seqstacklen<t>(seqstack<t> seqstack)         {             return seqstack.top + 1;         }         #endregion     } } 。