테트리스 회전

package Day056;

import java.util.Scanner;

/*
 * 문제)  아래 명령어를 입력받을때마다 block배열을 회전해보세요
 * 예) 1) left_turn
 * 4 8 12 16
 * 3 7 11 15
 * 2 6 10 14
 * 1 5 9  13
 */

public class Ex00603테트리스회전답없음 {
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        int block[][] = {
                {1,  2,  3,  4},
                {5,  6,  7,  8},
                {9, 10, 11, 12},
                {13,14, 15, 16},
        };
        int size = block.length;
        int tmpBlock[][] = new int[size][size];

        while(true) {
            for (int i=0; i<size; i++){
                for (int j=0; j<size; j++){
                    tmpBlock[i][j]=block[i][j];
                }
            }
            for(int i=0; i<block.length; i++) {
                for(int j=0; j<block[i].length; j++) {
                    System.out.print(block[i][j] + "\t");
                }
                System.out.println("\n");
            }
            System.out.println();

            System.out.println("(1)left (2)right");
            int move = scan.nextInt();

            if(move == 1) {
                for (int i=0; i<block.length; i++){
                    for (int j=0; j<block[i].length; j++){
                        block[i][j]=tmpBlock[j][size-1-i];
                    }
                }
            }
            else if(move == 2) {
                for (int i=0; i<block.length; i++){
                    for (int j=0; j<block[i].length; j++){
                        block[j][size-1-i]=tmpBlock[i][j];
                    }
                }
            }
        }

    }
}

좌표쓰면서 규칙을 찾아보면 생각보다 간결하게 가능했다

컴퓨터처럼 생각을 해주자