[백준/자바] 1427 - 소트인사이드

선택 정렬을 이용한 풀이

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char[] cArr = sc.next().toCharArray();
        int[] arr = new int[cArr.length];
        for(int i=0; i<cArr.length; i++) {
            arr[i] = cArr[i] - '0';
        }

        for(int i=0; i<arr.length; i++) {
            int max = i;
            for(int j=i+1; j<arr.length; j++) {
                if(arr[max] < arr[j]) max = j;
            }
            if(arr[i] < arr[max]) {
                int temp = arr[i];
                arr[i] = arr[max];
                arr[max] = temp;
            }
        }
        for(int i : arr) {
            System.out.print(i);
        }
    }
}

---

Arrays.sort()를 이용한 풀이

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char[] cArr = sc.next().toCharArray();
        int[] arr = new int[cArr.length];
        for(int i=0; i<cArr.length; i++) {
            arr[i] = cArr[i] - '0';
        }

        Arrays.sort(arr);

        for(int i=arr.length - 1; i>=0; i--) {
            System.out.print(arr[i]);
        }
    }
}