BJFU 242基于栈的回文字符序列判断（直接调用stack功能）

```cpp
#include <bits/stdc++.h>
using namespace std;

int main() {
	char s[100];//字符串 
	stack <char> mystack;
	while (cin >> s) {
		string buf = s;
		if (!strcmp(s,"0")) break;  //退出条件 ***
		
		for (int i = 0; i < buf.size(); i++) {
			mystack.push(s[i]);  //入栈 
		}
		bool flag = 1; //标记
		for (int i = 0; i < buf.size(); i++) {
			if (s[i] == mystack.top()) {
				mystack.pop();		
			}
			else {
				 flag = 0;
			}

		}
		if (flag == 1) cout << "YES" << endl;
		else cout << "NO" << endl;
		

	}


}