Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
38 lines (33 loc) · 696 Bytes

File metadata and controls

38 lines (33 loc) · 696 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package org.acm.oct;
import java.util.Scanner;
public class Algorithm3 {
public static void main(String[] args) {
Scanner s1=new Scanner(System.in);
int num=s1.nextInt();
char temp;
String[] str=new String[num];
for(int i=0;i<num;i++){
str[i]=s1.next();
}
char[] cs=new char[3];
for(int i=0;i<num;i++){
//得到输入的字符串
for(int j=0;j<3;j++)
cs[j]=str[i].charAt(j);
//进行排序
for(int k=0;k<3;k++){
for(int j=0;j<2;j++){
if(cs[j]>cs[j+1]){
temp=cs[j];
cs[j]=cs[j+1];
cs[j+1]=temp;
}
}
}
for(int j=0;j<2;j++)
System.out.print(cs[j]+" ");
System.out.println(cs[2]);
}
//外层for
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.