[백준] 1085 - 직사각형에서 탈출 (JAVA/ 자바)

1085번 문제(1)

1085번 문제(2)

 

 

1. Scanner를 이용한 방법

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 xmin = Math.min(x, w-x);
    int ymin = Math.min(y, h-y);

    System.out.println(Math.min(xmin, ymin));
    sc.close();
    }
}

 

2. BufferedReader를 이용한 방법

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

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

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(br.readLine(), " ");

    int x = Integer.parseInt(st.nextToken());
    int y = Integer.parseInt(st.nextToken());
    int w = Integer.parseInt(st.nextToken());
    int h = Integer.parseInt(st.nextToken());

    int xmin = Math.min(x, w-x);
    int ymin = Math.min(y, h-y);

    System.out.println(Math.min(xmin, ymin));
    br.close();
    }
}

Math.min()을 이용해서 최솟값을 구해주면 된다.