链栈的实现：
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace 栈
{
class LinkStark<T> : IStackDS<T>
{
private Node<T> top; //栈顶元素节点
private int count = 0; //栈里面的元素
public int Count
{
get
{
return count;
}
}
/// <summary>
/// 清空栈中数据
/// </summary>
public void Clear()
{
count = 0;
top = null;
}
/// <summary>
/// 栈的长度
/// </summary>
/// <returns></returns>
public int GetLength()
{
return Count;
}
/// <summary>
/// 栈中是否有数据
/// </summary>
/// <returns></returns>
public bool IsEmpty()
{
return count == 0;
}
public T Peek()
{
return top.Data;
}
/// <summary>
/// 出栈 取得栈顶元素然后删除
/// </summary>
/// <returns></returns>
public T Pop()
{
T data = top.Data;
top = top.Next;
count--;
return data;
}
/// <summary>
/// 入栈
/// </summary>
/// <param name="item"></param>
public void Push(T item)
{//把新添加的元素作为头结点，就是栈顶
Node<T> newNode = new Node<T>(item);
newNode.Next = top;
top = newNode;
count++;
}
}
}
以上是链栈的实现
下面是测试：
- C#库中带的栈
- 自己的写的顺序栈
- 自己写的链栈
amespace 栈
{
class Program
{
static void Main(string[] args)
{
//使用BCL中的栈
//Stack<char> stack = new Stack<char>();
//使用自己的栈
// SeqStack<char> stack = new SeqStack<char>();
//使用自己的链栈
IStackDS<char> stack = new LinkStark<char>();
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();
}
}
}
