C#实现顺序栈和链栈的代码实例

 namespace 栈 { interface IStackDS { int Count { get; } int GetLength(); bool IsEmpty(); void Clear(); void Push(T item); T Pop(); T Peek(); } }

 namespace 栈 { class SeqStack : IStackDS { private T[] data; //栈 private int top; //栈顶 //构造函数 public SeqStack(int size) { data = new T[size]; top = -1; } public SeqStack() : this(10) { data = new T[10]; top = -1; } //栈的元素个数属性 public int Count { get { return top + 1; } } //清空栈的方法 public void Clear() { top = -1; } //获取栈的长度的方法 public int GetLength() { return Count; } //查看栈顶元素是什么 public T Peek() { if (top == -1) { Console.WriteLine("当前栈没有元素"); return default(T); } return data[top]; } //出栈（取出栈顶元素，并移除） public T Pop() { T temp = data[top]; top--; return temp; } //入栈 public void Push(T item) { data[top + 1] = item; top++; } //栈中是否源元素 public bool IsEmpty() { return Count==0; } } }

 namespace 栈 { /// 
 /// 链栈的节点 /// 
 ///  class Node { private T data; //数据 private Node next; //指向下一个的引用 //四个构造函数，不是都有用，，以及上面两个变量的属性， public Node() { data = default(T); next = null; } public Node(T data) { this.data = data; next = null; } public Node(T data , Node index) { this.data = data; this.next = index; } public Node(Node index) { data = default(T); next = index; } public T Data { get { return data; } set { data = value; } } public Node Next { get { return next; } set { next = value; } } } }

 using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace 栈 { class LinkStark : IStackDS { private Node top; //栈顶元素节点 private int count = 0; //栈里面的元素 public int Count { get { return count; } } /// 
 /// 清空栈中数据 /// 
 public void Clear() { count = 0; top = null; } /// 
 /// 栈的长度 /// 
 ///  public int GetLength() { return Count; } /// 
 /// 栈中是否有数据 /// 
 ///  public bool IsEmpty() { return count == 0; } public T Peek() { return top.Data; } /// 
 /// 出栈 取得栈顶元素然后删除 /// 
 ///  public T Pop() { T data = top.Data; top = top.Next; count--; return data; } /// 
 /// 入栈 /// 
 ///  public void Push(T item) {//把新添加的元素作为头结点，就是栈顶 Node newNode = new Node(item); newNode.Next = top; top = newNode; count++; } } }

 amespace 栈 { class Program { static void Main(string[] args) { //使用BCL中的栈 //Stack stack = new Stack(); //使用自己的栈 // SeqStack stack = new SeqStack(); //使用自己的链栈 IStackDS stack = new LinkStark(); stack.Push('a'); stack.Push('b'); stack.Push('c'); Console.WriteLine("push后的数据个数"+ stack.Count); char temp = stack.Pop(); Console.WriteLine("pop 之后数据是："+ temp); Console.WriteLine("pop 之后数据个数"+stack.Count); char temp2 = stack.Peek(); Console.WriteLine("Peek 之后数据是：" + temp2); Console.WriteLine("Peek 之后数据个数" + stack.Count); Console.ReadKey(); } } }