[java] 이코테_구현) 문자열 재정렬

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
 
public class Main {
 
    public static List<Integer> numberArr=new ArrayList<>();
    public static List<String> stringArr=new ArrayList<>();
 
    public static boolean isInteger(String strValue) {
        try {
            Integer.parseInt(strValue);
            return true;
        } catch (NumberFormatException ex) {
            return false;
        }
    }
 
    public static String str=null;
    public static void main(String[] args) throws IOException {
 
        BufferedReader br=new BufferedReader(new BufferedReader(new InputStreamReader(System.in)));
        StringTokenizer st=new StringTokenizer(br.readLine());
        str=st.nextToken();
        for(int i=0;i<str.length();i++){
            String s=Character.toString(str.charAt(i));
 
            if(isInteger(s)){
                numberArr.add(Integer.parseInt(s));
            }else{
                stringArr.add(s);
            }
 
            Collections.sort(numberArr);
            Collections.sort(stringArr);
 
 
 
        }
        for(int i=0;i<stringArr.size();i++){
            System.out.print(stringArr.get(i));
        }
        for(int i=0;i<numberArr.size();i++){
            System.out.print(numberArr.get(i));
        }
 
 
 
 
 
    }
}