[백준] 1085번: 직사각형에서 탈출 (Java)

✅ 문제

https://www.acmicpc.net/problem/1085

 

 

✅ 풀이

• x, y, w-x, h-y 값을 배열에 저장한 후, 배열을 순회하며 최솟값을 구해준다.

 

 

 

 

✅ 코드

import java.util.Scanner;

public class Main{
    public static void main(String[] args){

        Scanner sc = new Scanner(System.in);

        int x = sc.nextInt();
        int y = sc.nextInt();
        int w = sc.nextInt();
        int h = sc.nextInt();

        int[] distances = new int[4];
        distances[0] = x;
        distances[1] = y;
        distances[2] = w - x;
        distances[3] = h - y;

        int min = distances[0];
        for(int distance : distances){
            if (distance < min) min = distance;
        }

        System.out.println(min);
    }
}