본문 바로가기
Problem Solving/Baekjoon

[백준] 16756 Pismo - Greedy / Java

by graycode 2024. 5. 12.

 문제 링크

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();
    }

}

댓글