• 문제 링크
https://www.acmicpc.net/problem/13280
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
int n;
while ((n = read()) != 0) {
int[] arr = new int[n];
for (int i = 0; i < n; i++) arr[i] = read();
Arrays.sort(arr);
int min = Integer.MAX_VALUE;
for (int i = 1; i < n; i++) min = Math.min(min, arr[i] - arr[i - 1]);
sb.append(min).append('\n');
}
bw.write(sb.toString());
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 3062 수 뒤집기 - Implementation / Java (0) | 2025.03.10 |
---|---|
[백준] 2783 삼각 김밥 - Implementation / Java (0) | 2025.03.09 |
[백준] 13774 Palindromes - Brute Force / Java (0) | 2025.03.08 |
[백준] 32290 MEX vs OR - Brute Force / Java (0) | 2025.03.06 |
[백준] 10372 Alarm Clock - Brute Force / Java (0) | 2025.03.05 |
댓글