exam3-3.cpp

来自「C++版的数据结构源代码」· C++ 代码 · 共 43 行

#include <iostream.h>
#include <string.h>
#include <stdlib.h>

#include "LinQueue.h"
#include "LinStack.h"

void HuiWen(char str[])
//判断字符串str是否是回文
{
	LinStack<char> myStack;
	LinQueue<char> myQueue;
	
	int n = strlen(str);				//求字符串长度
	for(int i = 0; i < n; i++)
	{
		myQueue.Append(str[i]);
		myStack.Push(str[i]);
	}

	while(myQueue.NotEmpty() && myStack.NotEmpty() )
	{
		if(myQueue.Delete() != myStack.Pop()) 
		{
			cout << "不是回文!" << endl;
			return;
		}
	}
	cout << "是回文!" << endl;
}

void main(void)
{
	char str1[] = {"ABCDEDCBA"};
	char str2[] = {"ABCDEDBAC"};

	cout << "字符串ABCDEDCBA";
	HuiWen(str1);

	cout << "字符串ABCDEDBAC";
	HuiWen(str2);
}