L1-027 出租 (20分)

题目

#include<iostream>
#include<string>
#include<set>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
	string s;
	int a[10] = { 0 };
	cin >> s;
	int arr[10] = { 0 };
	int index[12] = { 0 };
	int t, n;
	for (int i = 0; i < s.length(); i++)  //找到存在的各个数
	{
		t = s[i] - '0';
		a[t]++;
	}
	t = 0;
	for (int i = 9; i >= 0; i--) //确定arr数组
	{
		if (a[i])
		{
			arr[t++] = i;
		}
	}
	n = 0;
	for (int i = 0; i < s.length(); i++)
	{
		for (int j = 0; j < t; j++)
		{
			if (arr[j] == s[i] - '0')
			{
				index[n++] = j;
			}
		}
	}
	cout << "int[] arr = new int[]{";  //第一个数组
	int flag = 0;
	for (int i = 0; i < t; i++)
	{
		if (flag) cout << ",";
		cout << arr[i];
		flag = 1;
	}
	cout << "};" << endl;
	cout << "int[] index = new int[]{";  //第二个数组
	flag = 0;
	for (int i = 0; i < n; i++)
	{
		if (flag) cout << ",";
		cout << index[i];
		flag = 1;
	}
	cout << "};" << endl;
}