[java] 백준 16926 : 배열 돌리기 1

https://www.acmicpc.net/problem/16926

16926번: 배열 돌리기 1

 

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
	static int[][] arr;
	static int min,n,m,cnt;
	static int[] dx = {0,1,0,-1};
	static int[] dy = {1,0,-1,0};
	
    public static void main(String[] args) throws IOException {
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      StringTokenizer st = new StringTokenizer(br.readLine());
      
      n = Integer.parseInt(st.nextToken());
      m = Integer.parseInt(st.nextToken());
      cnt = Integer.parseInt(st.nextToken());
      
     
      arr = new int[n][m];
      for(int i=0; i<n; i++) {
    	  st = new StringTokenizer(br.readLine());
    	  for(int j=0; j<m; j++) {
    		  arr[i][j] = Integer.parseInt(st.nextToken());
    	  }  
      }
      
      min = Math.min(n, m);
    
    for(int i=1; i<=cnt; i++) {
    	rotate();
    }
    
    for(int i=0; i<n; i++) {
  	  for(int j=0; j<m; j++) {
  		  System.out.print(arr[i][j]+" ");
  	  }  
  	  System.out.println();
    }
      
      
    }
    
    static void rotate() {
    	
    	for(int t=0; t<min/2; t++ ) { //회전 시킬 그룹의 갯수 
    		int x = t;
    		int y = t;
    		int temp = arr[x][y]; //마지막에 넣을 ㄹ값
    		
    		int idx =0;
    		while(idx <4) {
    			int nx = x + dx[idx];
    			int ny = y + dy[idx];
    			
    			if(nx < n-t && ny <m-t && nx >= t && ny >=t) {
    				arr[x][y] = arr[nx][ny];
    				x = nx;
    				y = ny;
    			}else {
    				idx++;
    			}
    			
    		}
    		arr[t+1][t]= temp;
    	}
    }
    
    
}

 

참고

https://dev2som.tistory.com/118

https://velog.io/@cheal3/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98-%EB%B0%B1%EC%A4%80-16926-%EB%B0%B0%EC%97%B4-%EB%8F%8C%EB%A6%AC%EA%B8%B01-%EC%9E%90%EB%B0%94