[알고리즘] 배열회전, Rotation of Array in Java

public class Rotate {
	static int[][] rotate(int[][] arr, int degree){
		int n = arr.length;
		int m = arr[0].length;
		int[][] rotate = null;
		
		switch(degree) {
		case 90:
			rotate = new int[m][n];
			break;
		case 180:
			rotate = new int[n][m];
			break;
		case 270:
			rotate = new int[m][n];
			break;
		default:
			break;
		}
		
		for(int i=0; i<rotate.length; i++) {
			for(int j=0; j<rotate[i].length; j++) {
				switch(degree) {
				case 90:
					rotate[i][j] = arr[n-1-j][i];
					break;
				case 180:
					rotate[i][j] = arr[n-1-i][m-1-j];
					break;
				case 270:
					rotate[i][j] = arr[j][m-1-i];
					break;
				default:
					break;
				}
			}
		}
		return rotate;
	}
}