题解 | 提取不重复的整数

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <map>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>//队列
#include <stack> //栈
//#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define endl '\n'
#define pii pair<int, int>
//queue<int> que;
//set<int> s;
//stack<int> st;



void solve() {
    //scanf("%d", &);
    //printf("\n", );

    /*
    cout << "手慢无" << endl;
    cout << "骗你的，手快也无" << endl;
    cout << "haha ^_^" << endl;
    */

    //vector<int>a(n);
    //sort(a.begin(), a.end());
    //map<int, int>mp;

    string s;
    cin>>s;

    reverse(s.begin(),s.end());//倒序
    map<char,int>mp;//记录出现次数
    //cout<<s;
    for(int i=0;i<s.size();i++)
    {
        if(mp[s[i]]==0)
        {
            cout<<s[i];
            mp[s[i]]++;
        }
    }

}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
        cout << endl;
    }
    return 0;
}