
내풀이1>
import java.util.*; public class Main { public int[] solution(int n, int[] arr) { int[] answer = Arrays.stream(arr).sorted().toArray(); return answer; } public static void main(String[] args) { Main T = new Main(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = kb.nextInt(); } for (int x : T.solution(n, arr)) { System.out.print(x + " "); } } }
내풀이2>
import java.util.*; public class Main { public int[] solution(int n, int[] arr) { Arrays.sort(arr); return arr; } public static void main(String[] args) { Main T = new Main(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = kb.nextInt(); } for (int x : T.solution(n, arr)) { System.out.print(x + " "); } } }
다른 풀이>
import java.util.*; public class Main { public int[] solution(int n, int[] arr) { for (int i = 0; i < n; i++) { int idx = i; for (int j = i + 1; j < n; j++) { if (arr[j] < arr[idx]) { idx = j; } } int tmp = arr[i]; arr[i] = arr[idx]; arr[idx] = tmp; } return arr; } public static void main(String[] args) { Main T = new Main(); Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] arr = new int[n]; for (int i = 0; i < n; i++) { arr[i] = kb.nextInt(); } for (int x : T.solution(n, arr)) { System.out.print(x + " "); } } }