当时数据结构就没有学好…不管怎么说加油吧
代码:
#include<iostream>
using namespace std;
/*链表实现堆栈+堆栈应用:括号匹配*/
template<class T>
class SNode {
private:
T data;
SNode * next;
public:
SNode(T data) {
this->data = data;
this->next = NULL;
}
SNode * getNext() {
return this->next;
}
T getData() {
return this->data;
}
void setNext(SNode<T> * next) {
this->next = next;
}
void setData(T data) {
this->data = data;
}
};
template<class T>
class Stack {
private :
SNode<T> * top;
public:
Stack() {
top = NULL;
}
~Stack() {
clear();
}
void clear();//清空栈
void push(const T& item);//向栈顶压入一个元素
bool pop();//从栈顶弹出一个元素
const T& peek();//取栈顶元素
bool isEmpty();//检查栈是否为空
};
template<class T>
void Stack<T>::clear()
{
while (!isEmpty()) {
SNode<T> * temp = top;
top->setNext(top->getNext());
delete temp;
}
}
template<class T>
void Stack<T>::push(const T & item)
{
SNode<T> *node = new SNode<T>(item);
node->setNext(top);
top = node;
}
template<class T>
bool Stack<T>::pop()
{
if (isEmpty()) {
cout << "栈为空,不可以弹栈" << endl;
return false;
}
else {
SNode<T> * temp = top;
top = top->getNext();
delete temp;
return true;
}
}
template<class T>
const T& Stack<T>::peek()
{
if (isEmpty()) {
cout << "栈为空,不可以读取数据" << endl;
return NULL;
}
else {
return top->getData();
}
}
template<class T>
bool Stack<T>::isEmpty()
{
if (top == NULL) {
return true;
}
else
return false;
}
int main() {
Stack<char> * brackets = new Stack<char>();
char readin = cin.get();
bool isMatch = true;
while (isMatch&&readin != '\n') {
if (readin == '(' || readin == '[' || readin == '{')
brackets->push(readin);
if (readin == ')' || readin == ']' || readin == '}') {
switch (readin)
{
case ')': {
char c = brackets->peek();
brackets->pop();
if (c != '(')
isMatch = false;
}break;
case ']': {
char c = brackets->peek();
brackets->pop();
if (c != '[')
isMatch = false;
}
case '}': {
char c = brackets->peek();
brackets->pop();
if (c != '{')
isMatch = false;
}
default:
break;
}
}
readin = cin.get();
}
if (isMatch) {
cout << "括号匹配成功!" << endl;
}
else {
cout << "括号匹配失败!" << endl;
}
system("pause");
return 0;
}