HDOJ 1106 排序

import java.util.Arrays;
import java.util.Scanner;
//输入数据保证：分割得到的非负整数不会大于100000000；输入数据不可能全由‘5’组成。
public class Main{

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
String num  = sc.next();
String[] nums = num.split("5");
int[] number = new int[1001];//这行数字的长度不大于1000
int count = 0;//用来记录分多少组
for (int i = 0; i < nums.length; i++) {
if (nums[i].equals("")) {
continue;
}
number[count++]= Integer.parseInt(nums[i]);
}
Arrays.sort(number, 0, count);//从小到大排列数组
System.out.print(number[0]);
for (int i = 1; i < count; i++) {
System.out.print(" "+number[i]);
}
System.out.println();
}
}
}