栈的应用---括号匹配问题

//括号匹配问题
//.....................stack.h
#ifndef   _STACK_H_
#define   _STACK_H_

#include<iostream>
using namespace std;

#define bool int
#define false 0
#define true 1

//  顺序栈


template<class Type>
class Stack
{
public:
Stack(size_t sz=STACK_DEFAULT_SIZE) //构建栈空间
{
capacity=sz>STACK_DEFAULT_SIZE?sz:STACK_DEFAULT_SIZE;
base=new Type[capacity]; //开辟空间
top=0;
}
~Stack()
{
delete []base;
base=NULL;
capacity=top=0;
}
public:
bool empty() const                  
{
return(top == 0);
}
    bool full()const                  
{
return(top >= capacity);
}
public:
Type push(const Type &x)  //入栈
{
if(!full())
{
base[top++] = x;
}
return base[top];
}
Type pop()//出栈
{
if(!empty())
{
top--;
 return base[top];
}
}
void show_stack()const
{
int i;
if(top==0)
{
cout<<"栈为空"<<endl;
return ;
}
for(i=top-1;i>=0;i--)
{
cout<<base[i]<<endl;
}
}

size_t length()const
{
return top;
}
void clear_stack()
{
top=0;
}
/*Type gettop(const Type &e)  //得到栈顶元素
{
if(!empty())
{
return base[top-1];
}
}
*/
    Type gettop()const
{
if(!empty())
{
return base[top-1];
}
    }

private:
enum {STACK_DEFAULT_SIZE=20};
Type *base;
size_t  capacity;
size_t top;
};
#endif

//.................main.cpp
#include"stack.h"
bool Check(const char *str)
{
Stack<char> stack;
int s=strlen(str);
int i=0;
for(i=0;i<s;i++)
{
switch(str[i])
{
case'(':
case'[':stack.push(str[i]);
     break;
   case')':
if(stack.pop()!='(')
{
return false;
}
break;
case']':
if(stack.pop()!='[')
{
return false;
}
break;
}
}
}
void main()
{
char *str="[([]))([])]";
bool flag=Check(str);
if(flag)
cout<<"ok."<<endl;
else
cout<<"error."<<endl;
}