As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 46623 Accepted Submission(s): 19951
Problem Description
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
It is guarantied that all integers are in the range of 32-int.
Output
For each case, print the sorting result, and one line one case.
Sample Input
2 3 2 1 3 9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3 1 2 3 4 5 6 7 8 9
此题是一个排序问题;我用的是冒泡 还可以用插入,二分,选择排序,归并排序,希尔排序,快速排序以下方法参考我的博客排序
package HDU;
import java.util.Scanner;
public class p1040 {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int m=sc.nextInt();
while(m-->0){
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int temp=0;
for(int i=0;i<a.length-1;i++){
for(int j=0;j<a.length-i-1;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
for(int i=0;i<n;i++){
System.out.print(a[i]);
if(i==n-1){
break;
}
System.out.print(" ");
}
System.out.println();
}
}
}
剪切 (Ctrl+X)复制 (Ctrl+C)粘贴 (Ctrl+V)粘贴文本段落标签字体字体大小加粗 (Ctrl+B)斜体 (Ctrl+I)下划线 (Ctrl+U)删除线字体颜色背景颜色删除文字格式对齐列表减少缩进增加缩进超链接 (Ctrl+L)取消超链接图片表情表格插入代码引用CODE代码片源代码全屏编辑 (Esc)关于 xhEditor |