基于栈的平衡符号匹配问题

栈的实现

基于vector顺序容器的栈的实现

#ifndef WEIWEI_H
#define WEIWEI_H

#include
using std::vector;

template
class Stack{
public:
	Stack(int val=-1):topOfStack(val){}
	void push(const object& val)
	{
		topOfStack++;
		theArray.push_back(val);
	}
	object & pop()
	{
		object temp=theArray.back();
		topOfStack--;
		theArray.pop_back();
		return temp;
	}
	object & top()
	{
		return theArray.back();
	}
	bool isEmpty()
	{
		return topOfStack==-1;
	}
private:
	vector theArray;
	int topOfStack;
};

#endif 
  


 

#include
#include
#include
#include"weiwei.h"
using namespace std;

int main(){
	Stack s;
	ifstream infile("1.txt");
	if(!infile)
	{
		cout<<"文件打开失败!";
		return 4;
	}
	ofstream outfile("2.txt");
	if(!outfile)
	{
		cout<<"文件打开失败!";
		return 4;
	}
	string line;
	char w;
	while(getline(infile,line))
	{
		istringstream stream(line);
		while(stream>>w){
			if(w=='('||w=='['||w=='{')
			{
				s.push(w);
				outfile<


 

你可能感兴趣的:(C++,数据结构)