简单的排序问题
代码如下 :
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.StreamTokenizer;
import java.util.Scanner;
import java.util.Arrays;
public class Main implements Runnable{
private Scanner cin;
private PrintWriter cout;
private static final boolean DEBUG = false;
private int n;
private int[] nums;
private void init()
{
try
{
if (DEBUG)
{
cin = new Scanner(new BufferedReader(new InputStreamReader(new FileInputStream("e:\\program\\idea\\spoj\\spoj.txt"))));
}
else
{
cin = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
}
cout = new PrintWriter(System.out);
}
catch (IOException e)
{
e.printStackTrace();;
}
}
private void input()
{
n = cin.nextInt();
nums = new int[n];
for (int i = 0; i < n; i++)
{
nums[i] = cin.nextInt();
}
}
private void solve()
{
Arrays.sort(nums);
for (int i = 0; i < n; i++)
{
if (i != 0) cout.print(" ");
cout.print(nums[i]);
}
cout.println();
cout.flush();
}
public void run() {
init();
int cas = cin.nextInt();
while (cas-- > 0)
{
input();
solve();
}
}
public static void main(String[] args)
{
new Thread(new Main()).start();
}
}