본문 바로가기

Algorithm/Baekjoon

[백준_JAVA] 9063 대지

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		while(true) {
			int num = scan.nextInt();
			int[] x = new int[num];
			int[] y = new int[num];
			
			int maxX = Integer.MIN_VALUE; int minX = Integer.MAX_VALUE;
			int maxY = Integer.MIN_VALUE; int minY = Integer.MAX_VALUE;
			
			for(int i = 0; i < num; i++) {
				x[i] = scan.nextInt();
				y[i] = scan.nextInt();
				
				if(x[i] > maxX) maxX = x[i];
				if(x[i] < minX) minX = x[i];
				
				if(y[i] > maxY) maxY = y[i];
				if(y[i] < minY) minY = y[i];
			}
			
			if(num == 1) {
				System.out.println(0);
				break;
			}
			else System.out.println((maxX-minX)*(maxY-minY)); break;
		}
	}
}

런타임 에러 => while문 무한루프 때문, break; 작성하기