COS PRO 1급 JAVA 소용돌이의 수

 

 

[소스 코드]

class Main {
    public int solution(int n) {
	      int[][] map = new int[n][n];
				int num  = 1;
				int top = 0; int bottom = n-1;
				int max = n-1; int min = 0;
				int answer = 0;
				while(num<=n*n){
					for(int i=min;i<=max;i++) map[top][i] = num++;
					top++;
					for(int i=top;i<=bottom;i++) map[i][max] = num++;
					max--;
					for(int i=max;i>=min;i--) map[i][bottom] = num++;
					bottom--;
					for(int i=bottom;i>=top;i--) map[min][i] = num++;
					min++;
				}
				for(int i=0;i<n;i++) answer += map[i][i];
        return answer;
    }
}