pair.cpp

常用算法与数据结构原代码

#include <iostream.h>
#include <string.h>
#include <stdio.h>
#include "stack.h"

const int MaxLength = 100;	//最大字符串长度

void PrintMatchedPairs(char *expr)
{
	Stack<int> s(MaxLength);
	int i, j, length = strlen(expr);

	// 从表达式中搜索(和)
	for (i=0; i<length; i++)
	{
		if (expr[i] == '(')
			s.Add(i);
		else if (expr[i] == ')')
		{
			try{
				s.Delete(j);
				cout<<j+1<<' '<<i+1<<endl;
			}
			catch(OutOfBounds)
			{
				cout<<"No match for right parenthesis at "<<i+1<<endl;
			}
		}
	}

	while(!s.IsEmpty())
	{
		s.Delete(j);
		cout<<"No match for left parenthesis at "<<j+1<<endl;
	}
}

void main(void)
{
	char expr[MaxLength];
	cout<<"Type an expression of length at most "<<MaxLength<<endl;
	cin.getline(expr, MaxLength);
	cout<<"The pairs of matching parentheses in"<<endl;
	cout<<expr;
	cout<<"are"<<endl;
	PrintMatchedPairs(expr);
}