字符串简单模拟

PATB1009

#include <stack>
#include <cstdio>
#include <string>
#include <iostream>
using namespace std;
int main()
{
    string s;
    stack<string> v;
    while(cin >> s)
        v.push(s);
    cout << v.top();
    v.pop();
    while(!v.empty())
    {
        cout << " " << v.top();
        v.pop();
    }
    return 0;
}

总结：
1.字符串压栈是一个词一个词进
2.先输出栈顶一个词使格式正确，否则后续空格有问题

回文串

#include <string>
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    string s;
    cin >> s;
    string b=s;
    reverse(s.begin(),s.end());
    if(b==s)
        cout << "YES";
    else
    cout << "NO";
    return 0;
}

总结：

1. reverse(s.begin(),s.end())