提取不重复的整数

#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<numeric>
#include <string>
#include <map>
#include <iomanip>
#include<ctime>
#include<cmath>
using namespace std;
int main()
{
    int num, n;
    //vector<int> v(10, 0);//vector插入10个0
    vector<int> v;
    v.insert(v.begin(),10, 0);
    cin >> n;
    while (n > 0)
    {
        num = n % 10;
        n /= 10;
        if (v[num] == 0)
        {
            v[num] = 1;
            cout << num;
        }
    }

    return 0;
}

#include<iostream>
#include<unordered_set>
using namespace std;
int main()
{
    string tmp;
    while(cin>>tmp)
    {
        unordered_set<char>record;
        string res;
        for(int i=tmp.size()-1;i>=0;i--)
        {
            if(record.count(tmp[i])==false)
            {
                record.insert(tmp[i]);
                res+=tmp[i];
                
            }
        }
        cout<<atoi(res.c_str())<<endl;
    }
}