今天帮人写了一个程序题,大意是数字从小到大排序,然后分别对应于英文,分别转换成英文之后然后打乱,让你去猜原理的数字;
输入:
NeNohuiroNNiNeteefersix
输出:
134699
code:
package java_10_A;
import java.util.Scanner;
public class a2 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int s0=0,s1=0,s2=0,s3=0,s4=0,s5=0,s6=0,s7=0,s8=0,s9=0;
String ssss= sc.next();
String ss= ssss.toLowerCase();
char ch[] =ss.toCharArray();
int e=0,f=0,g=0,h=0,i=0,n=0,o=0,r=0,s=0,t=0,u=0,v=0,z=0,w=0,x=0;
for (int ii=0;ii<ch.length;ii++){
if (ch[ii]=='e'){
e++;
}
if (ch[ii]=='f'){
f++;
}
if (ch[ii]=='g'){
g++;
}
if (ch[ii]=='h'){
h++;
}
if (ch[ii]=='i'){
i++;
}
if (ch[ii]=='n'){
n++;
}
if (ch[ii]=='o'){
o++;
}if (ch[ii]=='r'){
r++;
}
if (ch[ii]=='s'){
s++;
}
if (ch[ii]=='t'){
t++;
}if (ch[ii]=='u'){
u++;
}
if (ch[ii]=='w'){
w++;
}
if (ch[ii]=='v'){
v++;
}
if (ch[ii]=='z'){
z++;
}
if(ch[ii]=='x'){
x++;
}
//0
}
while(z--!=0){
e--;
r--;
o--;
s0++;
}//2
while(w--!=0){
t--;
o--;
s2++;
}
//4
while(u--!=0){
f--;
o--;r--;
s4++;
}
//8
while(g--!=0){
i--;
r--;
h--;
t--;
s8++;
}//3
while(h--!=0){
t--;r--;e-=2;
s3++;
}//6
while(x--!=0){
s--;
i--;
s6++;
}
//5
while(f--!=0){
i--;
v--;
e--;
s5++;
}//7
while(v--!=0){
s--;
n--;
e-=2;
s7++;
}//9
while(i--!=0){
n-=2;
e--;
s9++;
}
s1=o;
for(int mm=0;mm<s0;mm++){
System.out.print(0);
}
for(int mm=0;mm<s1;mm++){
System.out.print(1);
}
for(int mm=0;mm<s2;mm++){
System.out.print(2);
}
for(int mm=0;mm<s3;mm++){
System.out.print(3);
}
for(int mm=0;mm<s4;mm++){
System.out.print(4);
}
for(int mm=0;mm<s5;mm++){
System.out.print(5);
}
for(int mm=0;mm<s6;mm++){
System.out.print(6);
}
for(int mm=0;mm<s7;mm++){
System.out.print(7);
}
for(int mm=0;mm<s8;mm++){
System.out.print(8);
}for(int mm=0;mm<s9;mm++){
System.out.print(9);
}
}
}