L1-027. 出租

L1-027. 出租

题目地址：https://www.patest.cn/contests/gplt/L1-027


#include <iostream>
#include <memory.h>
using namespace std;

int main()
{
    char phoneNUmber[11];
    cin >> phoneNUmber;
    int number[10];
    int code[9];
    int phonebowen[11];
    memset(code, -1, sizeof(code));
    memset(number, -1, sizeof(number));
    for(int i=0; i<11; i++)
    {
        int k = phoneNUmber[i]-'0';
        phonebowen[i] = phoneNUmber[i]-'0';
        number[k] = 1;
    }
    int j=0;
    for(int i=8; i>-1; i--)
    {
        if(number[i]==1)
        {
            code[j] = i;
            j++;
        }

    }
    for(int i=0; i<11; i++)

    {

        for(int k=0; k<j; k++)
        {
            if(phonebowen[i]==code[k])
            {
                phonebowen[i] = k;
                //cout << "zhongyuxiangdentle\n";
                break;
            }
        }
    }
    cout << "int[] arr = new int[]{" << code[0];
    for(int i=1; i<j; i++)
        cout << "," << code[i];
    cout << "};" << endl;
    cout << "int[] index = new int[]{" << phonebowen[0];
    for(int i=1; i<11; i++)
        cout << "," <<phonebowen[i];
    cout << "};" << endl;

    return 0;
}