栈和队列应用之括号匹配

      括号匹配是计算机程序设计经常遇到的问题。为了简化问题，假设表达式只允许有2种括号：（），【】。 匹配格式为：（（）【】）和【（）【（）】【】】视为正确匹配。具体实现部分见下图代码：衷心希望网友提出改进意见，大家共同进步。

 1SeqStack<char> list=new SeqStack<char>(10);
 2           
 3            //栈的使用：括号匹配
 4            char[] str = new char[]{'[',']','(',')'};
 5            int len = str.Length;
 6            for (int i = 0; i < len; i++)
 7            { 
 8               //如果栈为空，将括号入栈
 9                if (list.IsEmpty())
                {
                    list.Push(str[i]);
                }
                else   //如果括号与栈顶的括号匹配，将栈顶括号出栈
                {
                    if (((list.GetTop() == '(') && (str[i] == ')')) || ((list.GetTop() == '[') && (str[i] == ']')))
                    {
                       
                        Console.WriteLine(list.Pop());
                    }
                    else  //如果括号与栈顶的括号不匹配，将括号入栈
                    {
                        list.Push(str[i]);
                    }
             
                }
        
            }
            //如果括号序列为空，栈为空则括号匹配，否则不匹配
            if (list.IsEmpty())
            {
                Console.WriteLine("匹配！");
            }
            else
            {
                Console.WriteLine("不匹配！");
            }
 

 

完整代码如下：

 

  1using System;
  2using System.Collections.Generic;
  3using System.Text;
  4
  5namespace 栈和队列
  6{
  7    class Program
  8    {
  9        public interface IStack<T>
 10        { 
 11           //求栈的长度
 12             int GetLength();
 13            //判断是否为空
 14            bool IsEmpty(); 
 15            //判断是否已满
 16            bool IsFull();
 17            //清空操作
 18            void Clear();
 19            //入栈
 20            void Push(T item);
 21            //出栈
 22            T Pop();
 23            //取栈顶元素
 24            T GetTop();
 25           
 26            
 27
 28        }
 29        public class SeqStack<T> : IStack<T>
 30        { 
 31           //栈的容量
 32            private int maxsize;
 33           //存储栈中的数据
 34            private T[] data;
 35           //指定栈的栈顶
 36            private int top;
 37
 38            //索引器
 39            public T this[int index]
 40            {
 41                get
 42                { 
 43                   return data[index];
 44                }
 45                set
 46                {
 47                    data[index] = value;
 48                }
 49            }
 50
 51            //容量属性
 52            public int Maxsize
 53            {
 54                get
 55                {
 56                    return maxsize;
 57                }
 58                set
 59                {
 60                    maxsize = value;
 61                }
 62            }
 63
 64            //栈顶属性
 65            public int Top
 66            {
 67                get
 68                {
 69                    return top;
 70                }
 71            }
 72
 73            //构造器
 74            public SeqStack(int size)
 75            {
 76                data = new T[size];
 77                maxsize = size;
 78                top = -1;
 79            }
 80
 81            //求栈的长度
 82            public int GetLength()
 83            {
 84                return top + 1;
 85            }
 86
 87            //清空栈
 88            public void Clear()
 89            {
 90                top = -1;
 91            }
 92
 93            //判断是否为空
 94            public bool IsEmpty()
 95            {
 96                if (top == -1)
 97                {
 98                    return true;
 99                }
                else
                {
                    return false;
                }
            }

            //判断是否以满
            public bool IsFull()
            {
                if (top == maxsize - 1)
                {
                    return true;
                }
                else
                {
                    return false;
                }
            }

            //入栈
            public void Push(T item)
            {
                if (IsFull())
                {
                    Console.WriteLine("栈满啦，要清空啦！");
                    return;
                }
                data[++top] = item;
                
            }
            //出栈
            public T Pop()
            { 
               T tmp=default(T);
               if (IsEmpty())
               {
                   Console.WriteLine("栈已空！");
                   return tmp;
               }
               tmp = data[top];
               --top;
               return tmp;
            }
            //获取栈顶数据元素
            public T GetTop()
            {
                if (IsEmpty())
                {
                    Console.WriteLine("表已空！");
                    return default(T);
                }
                return data[top];
            }
            
            

        }

        static void Main(string[] args)
        {
           
            SeqStack<char> list=new SeqStack<char>(10);
           
            //栈的使用：括号匹配
            char[] str = new char[]{'[',']','(',')'};
            int len = str.Length;
            for (int i = 0; i < len; i++)
            { 
               //如果栈为空，将括号入栈
                if (list.IsEmpty())
                {
                    list.Push(str[i]);
                }
                else   //如果括号与栈顶的括号匹配，将栈顶括号出栈
                {
                    if (((list.GetTop() == '(') && (str[i] == ')')) || ((list.GetTop() == '[') && (str[i] == ']')))
                    {
                       
                        Console.WriteLine(list.Pop());
                    }
                    else  //如果括号与栈顶的括号不匹配，将括号入栈
                    {
                        list.Push(str[i]);
                    }
             
                }
        
            }
            //如果括号序列为空，栈为空则括号匹配，否则不匹配
            if (list.IsEmpty())
            {
                Console.WriteLine("匹配！");
            }
            else
            {
                Console.WriteLine("不匹配！");
            }
 
          }

        }
    }