三. 栈

 1.栈是操作限定在表的尾端进行的线性表.　表尾由于要进行插入,删除等操作,　所以,把表尾称为栈顶,　另一端是固定的,角栈底.

2. 栈的接口定义

public interface IStack<T> { int GetLength(); bool IsEmpty(); bool IsFull(); void Clear(); void Push(T item); T Pop(); T GetTop(); }

 

3. 顺序栈　用一片连续的存储空间来存储栈中的数据元素.

public class SeqStack<T> : IStack<T> { private int maxsize; private T[] data; private int top; public T this[int index] { get { return data[index]; } set { data[index] = value; } } public int Maxsize { get { return maxsize; } set { maxsize = value; } } public int Top { get { return top; } } public SeqStack(int size) { data = new T[size]; maxsize = size; top = -1; } #region IStack<T> 成员 public int GetLength() { return top + 1; } public bool IsEmpty() { if (top == -1) { return true; } else { return false; } } public bool IsFull() { if (top == maxsize - 1) { return true; } else { return false; } } public void Clear() { top = -1; } public void Push(T item) { if (IsFull()) { Console.WriteLine("Stack is full!"); return; } data[++top] = item; } public T Pop() { T tmp = default(T); if (IsEmpty()) { Console.WriteLine("Stack is empty!"); return tmp; } tmp = data[top]; --top; return tmp; } public T GetTop() { if (IsEmpty()) { Console.WriteLine("Stack is empty!"); return default(T); } return data[top]; } #endregion }

 

4. 链栈　栈的另外一种存储方式,　通常用单链表来表示,　它的实现是单链表的简化.

public class LinkStack<T> : IStack<T> { private Node<T> top; private int num; public Node<T> Top { get { return top; } set { top = value; } } public int Num { get { return num; } set { num = value; } } public LinkStack() { top = null; num = 0; } #region IStack<T> 成员 public int GetLength() { return num; } public bool IsEmpty() { if ((top == null) && (num == 0)) { return true; } else { return false; } } public bool IsFull() { throw new Exception("The method or operation is not implemented."); } public void Clear() { top = null; num = 0; } public void Push(T item) { Node<T> q = new Node<T>(item); if (top == null) { top = q; } else { q.Next = top; top = q; } } public T Pop() { if (IsEmpty()) { Console.WriteLine("Stack is empty!"); return default(T); } Node<T> p = top; top = top.Next; --num; return p.Data; } public T GetTop() { if (IsEmpty()) { Console.WriteLine("Stack is empty!"); return default(T); } return top.Data; } #endregion }

 

5.　栈的应用:

十进制转八进制

public void Conversion(int n) { LinkStack<int> s = new LinkStack<int>(); while (n > 0) { s.Push(n % 8); n = n / 8; } while (!s.IsEmpty()) { n = s.Pop(); Console.WriteLine("{0}", n); } }

括号匹配

public bool MatchBracket(char[] charlist) { SeqStack<char> s = new SeqStack<char>(50); int len = charlist.Length; for (int i = 0; i < len; ++i) { if (s.IsEmpty()) { s.Push(charlist[i]); } else if (((s.GetTop() == ')') && (charlist[i] == ')')) || (s.GetTop() == '[') && charlist[i] == ']') { s.Pop(); } else { s.Push(charlist[i]); } } if (s.IsEmpty()) { return true; } else { return false; } }

 

C#2.0 提供了泛型的Ｓtack<Ｔ>类,　该类继承了IEnumerable<T>, ICollection和IEnumerable接口.