• 문제 링크
https://www.acmicpc.net/problem/16756
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] arr = new int[n];
for (int i = 0; i < n; i++) arr[i] = Integer.parseInt(st.nextToken());
int min = Integer.MAX_VALUE;
for (int i = 1; i < n; i++) min = Math.min(min, Math.abs(arr[i] - arr[i - 1]));
bw.write(String.valueOf(min));
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 6147 Bookshelf - Greedy / Java (0) | 2024.05.14 |
---|---|
[백준] 25335 Gravity Hackenbush - Greedy / Java (0) | 2024.05.13 |
[백준] 30088 공포의 면담실 - Greedy / Java (0) | 2024.05.11 |
[백준] 13238 Bitcoin investment - Greedy / Java (0) | 2024.05.10 |
[백준] 4852 Winter Festival - Graph Theory / Java (0) | 2024.05.09 |
댓글