Algorithm/JAVA - BOJ
BOJ/백준 - 2750 수 정렬하기 JAVA
ㅇㅇ잉
2021. 8. 9. 11:37
간단히 Arrays.sort로 정렬하면 된다.
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int N = Integer.parseInt(br.readLine());
int arr[] = new int[N];
for(int i=0;i<N;i++){
arr[i] = Integer.parseInt(br.readLine());
}
Arrays.sort(arr);
for(int val : arr){
sb.append(val).append('\n');
}
System.out.println(sb);
}
}
|
cs |
이건 버블 정렬 이용한 코드
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int N = Integer.parseInt(br.readLine());
int arr[] = new int[N];
for(int i=0;i<N;i++){
arr[i]=Integer.parseInt(br.readLine());
}
//버블정렬
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
if(arr[i]>arr[j]){
int tmp = arr[j];
arr[j]=arr[i];
arr[i]=tmp;
}
}
}
for(int val : arr){
sb.append(val).append('\n');
}
System.out.println(sb);
}
}
|
cs |
근데 위에 코드가 더 낫다.