天梯赛 L1-027 出租 (20 分)

vector的find函数用法

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int st[15];

int main()
{
    string s; cin >> s;
    
    for (int i = 0; i < s.size(); i ++ )
        st[s[i] - '0'] ++ ;
    
    cout << "int[] arr = new int[]{";
    
    bool ok = false;
    vector<int> ve;
    for (int i = 9; i >= 0; i -- )
    {
        if (st[i])
        {
            if (ok) cout << ",";
            cout << i;
            ok = true;
            ve.push_back(i);
        }
    }
    
    cout << "};\nint[] index = new int[]{";
    
    ok = false;
    for (int i = 0; i < s.size(); i ++ )
    {
        if (ok) cout << ",";
        ok = true;
        cout << find(ve.begin(), ve.end(), s[i] - '0') - ve.begin();
    }
    cout << "};";
}