#include<bits/stdc++.h>
using namespace std;
int main()
{
char n[12];
char arr[12]={0};
char index[12]={0};
cin>>n;
int book[11]={0};
for(int i=0;i<11;i++)
{
if(n[i]=='9')
book[9]++;
else if(n[i]=='8')
book[8]++;
else if(n[i]=='7')
book[7]++;
else if(n[i]=='6')
book[6]++;
else if(n[i]=='5')
book[5]++;
else if(n[i]=='4')
book[4]++;
else if(n[i]=='3')
book[3]++;
else if(n[i]=='2')
book[2]++;
else if(n[i]=='1')
book[1]++;
else if(n[i]=='0')
book[0]++;
}
for(int i=9,j=0;i>=0;i--)
{
if(book[i]==0)
continue;
else
{
arr[j]=i+'0';
j++;
}
}
for(int i=0,p=0;i<11;i++)
{
for(int j=0;arr[j]!='\0';j++)
{
if(arr[j]==n[i])
{
index[p]=j+'0';
p++;
}
}
}
cout<<"int[] arr = new int[]{";
for(int i=0;arr[i]!='\0';i++)
{
cout<<arr[i];
if(arr[i+1]!='\0')
cout<<",";
}
cout<<"};"<<endl;
cout<<"int[] index = new int[]{";
for(int i=0;index[i]!='\0';i++)
{
cout<<index[i];
if(index[i+1]!='\0')
cout<<",";
}
cout<<"};"<<endl;
}
挺简单一道题,但写了挺久的,权当记录一下吧
还是用的最笨的方法QAQ