链表实现堆栈+堆栈应用:括号匹配

当时数据结构就没有学好…不管怎么说加油吧

代码:

#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;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值