[algorithm] 1952 달팽이 java

www.acmicpc.net/problem/1952

1952번: 달팽이2

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int n = sc.nextInt();
		int [][]arr = new int[m][n];
		int max = m * n;
		int x = m;
		int y = n;
		int answer = 0;
		
		int i = 0;
		int j = -1;
		int count = 1;
		while(true) {
			for(int t = 0; t < n; t++) {
				j += count;
				arr[i][j] = max;
				max--;
			}
			
			m--;
			
			if(m <= 0) break;
			answer++;
			
			for(int t = 0; t < m; t++) {
				i += count;
				arr[i][j] = max;
				max--;
			}
			
			n--;
			
			if(n <= 0) break;
			count *= -1;
			answer++;
			
		}
		System.out.println(answer);
	}
}