[COS PRO 1급 기출문제 - Java] 1-5 소용돌이 수

edu.goorm.io/learn/lecture/17301/cos-pro-1%EA%B8%89-%EA%B8%B0%EC%B6%9C%EB%AC%B8%EC%A0%9C-java/lesson/839399/1%EC%B0%A8-%EB%AC%B8%EC%A0%9C5-%EC%86%8C%EC%9A%A9%EB%8F%8C%EC%9D%B4-%EC%88%98-java

goorm

 

문제 유형

solution 함수 구현

 

문제

 

import java.util.*;
 
class Main {
    public int solution(int n) {
        int answer = 0;
        // 소스 코드를 입력하세요.
      return answer;
    }
    
    public static void main(String[] args) {        Main sol = new Main();
        int n1 = 3;
        int ret1 = sol.solution(n1);
 
        
        System.out.println("solution 함수의 반환 값은 " + ret1 + " 입니다.");
        
        int n2 = 2;
        int ret2 = sol.solution(n2);
 
        System.out.println("solution 함수의 반환 값은 " + ret2 + " 입니다.");
    }
}

 

풀이

 

import java.util.*;
 
class Main {
    int[] dx = {0,1,0,-1};
    int[] dy = {1,0,-1,0};
    
    public int solution(int n) {
        int answer = 0;
                int[][] soyongdoli = new int[n][n];
            
                int turn = (n%2 == 0)? n/2: (n/2 + 1);
            
                int cx, cy, nx, ny;            
                int cur = 1;
                for(int i = 0; i< turn; i++){
                    int d = 0;
                    cx = i;
                    cy = i;
                    soyongdoli[cx][cy] = cur++;
                    
                    while(d < 4){
                      int nx = cx + dx[d];
                        int ny = cy + dy[d];
                        
                        if(nx >= n || nx < 0 || ny >= n || ny < 0 || soyongdoli[nx][ny] > 0){
                            d++;
                            continue;
                        }
                        
                        soyongdoli[nx][ny] = cur++;
                        cx = nx;
                        cy = ny;
                    }
                }
            
//            print(soyongdoli);
            answer = getResult(soyongdoli);
      return answer;
    }
 
    
    public int getResult(int[][] arr){
        int sum = 0;
        for(int i = 0; i<arr.length; i++){
                sum += arr[i][i];
        }
        return sum;
    }
    
    public void print(int[][] arr){
        for(int i = 0; i<arr.length; i++){
            for(int j = 0; j<arr[i].length; j++){
                System.out.print(arr[i][j] + " ");
            }
            System.out.println();
        }
    }