~~~
# As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others)????Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 48014????Accepted Submission(s): 20587
~~~
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!
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.
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
~~~
題目的大意為:第一行輸入你要輸入幾行的數據,然后第一列的數據是表示本行上有多少個數據,對其進行排序即可
~~~
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int num = scanner.nextInt();
int i = 0, j = 0, num2 = 0, m = 0, num3 = 0;
List listTemp = new ArrayList();
Object[] object = new Object[num];
while(i < num)
{
num2 = scanner.nextInt();
List list = new ArrayList();
object[i] = new Object();
for(j = 0; j < num2; j++)
{
num3 = scanner.nextInt();
list.add(num3);
}
list = sort2(list.toArray());
object[i] = list;
i++;
}
for(i = 0; i < object.length; i++)
{
listTemp = (List) object[i];
for(j = 0; j < listTemp.size(); j++)
{
if(j == 0)
System.out.print(listTemp.get(j));
else
System.out.print(" " + listTemp.get(j));
}
System.out.println();
}
}
private static List sort2(Object[] objects) {
List listTemp = new ArrayList();
int num1, num2, temp;
Object obj = null;
for(int i = 0; i < objects.length; i++)
{
num1 = Integer.parseInt(objects[i].toString());
for(int j = i; j < objects.length; j++)
{
num2 = Integer.parseInt(objects[j].toString());
if(num1 > num2)
{
temp = num1;
num1 = num2;
num2 = temp;
obj = objects[i];
objects[i] = objects[j];
objects[j] = obj;
}
}
listTemp.add(num1);
}
//System.out.println(listTemp);
return listTemp;
}
}
~~~
- 前言
- 求和的問題ACM
- A+B問題acm
- 1091ACM求和
- 杭電ACM1092求和問題詳解
- ACM杭電的1093求和問題
- 杭電ACM1094計算A+B的問題
- 杭電ACM1095解決A+B問題
- 杭電ACM1096求和問題
- 杭電Acm1001解決求和的問題
- 杭電ACM1008電梯問題C++
- 杭電ACM大賽2000關于ASCII碼排序的問題
- 杭電ACM2006奇數的乘積
- 杭電ACM數值統計2008
- 杭電ACM1019求最大公約數
- 杭電ACM1108求最小公倍數
- 杭電ACM2035人見人愛的A^B
- 杭電ACM1061N^N求最右邊的數的問題
- 杭電ACM1021裴波納挈數AGAIN
- 杭電ACm1005求f(n)非遞歸
- 杭電ACM1071The area---------求積分面積
- 杭電ACM吃糖果問題
- 杭電ACm求數列的和2009
- 杭電ACM多項式求和--》2011
- 杭電ACM。。。sort
- 杭電ACM1004
- 杭電ACM2043密碼的問題已經AC
- 杭電ACM2041樓梯問題
- 動態規劃C++::杭電ACM1003
- 杭電ACM----2018母牛的故事
- 杭電ACM2007平方和與立方和
- 盧卡斯隊列
- 全國軟件2. 三人年齡
- 全國軟件3. 考察團組成
- 全國軟件--微生物增殖
- 全國軟件填寫算式
- 全國軟件-----------猜生日
- 全國軟件---------歐拉與雞蛋
- Java經典算法四十例編程詳解+程序實例
- 杭電ACMA + B Problem II問題解析
- 杭電ACM1018BigNumber解析
- 杭電ACM1088 Write a simple HTML Browser Java
- 杭電ACM1106排序Java代碼
- 杭電ACM 1012 u Calculate e java
- 杭電ACM 1020 Encoding java解析
- 杭電1047 An Easy Task - java 解讀
- 杭電ACM 1040 As Easy As A+B java 解讀
- 杭電ACM 1041 Computer Transformation java代碼詳解AC
- 杭電ACM 1030 Delta-wave java代碼解析