Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 27961 Accepted Submission(s): 7710
你的任务是:对这些分割得到的整数,依从小到大的顺序排序输出。
输入数据保证:分割得到的非负整数不会大于100000000;输入数据不可能全由‘5’组成。
方法一
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(new BufferedInputStream(System.in)); while(sc.hasNext()){ ArrayList<Integer> ay=new ArrayList<Integer>(); String s=sc.next(); String str[]=s.split("5"); for(String s1:str){ if(!s1.equals("")){ ay.add(Integer.parseInt(s1)); } } Collections.sort(ay); for(int i=0;i<ay.size()-1;i++) System.out.print(ay.get(i)+" "); System.out.println(ay.get(ay.size()-1)); } } }
方法二
import java.io.*; import java.math.BigInteger; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(new BufferedInputStream(System.in)); PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out),true); while (sc.hasNext()) { String s = sc.next(); sc.nextLine(); if (s.charAt(0) == '-') s = s.substring(1); String str[] = s.split("[5]"); BigInteger big[] = new BigInteger[str.length]; int k = 0; for (int i = 0; i < str.length; i++) { if (!str[i].equals("")) { big[k] = BigInteger.valueOf(Integer.parseInt(str[i])); k++; } } for (int i = 0; i < k; i++) { for (int j = i + 1; j < k; j++) { if (big[i].compareTo(big[j]) == 1) { BigInteger t = big[i]; big[i] = big[j]; big[j] = t; } } } for (int i = 0; i < k - 1; i++) System.out.print(big[i] + " "); System.out.println(big[k - 1]); } } }