/* CC150 1.6 reverse String 20141220
 * blindchaser
 * Time Complexity:无数个O(n^2)...
 * Space Complexity: idk
 *
 * Problem: 当elements为多位数时，输出的对齐问题
 */
import java.util.Random;

public class RotateMatrix {
	static int n = 5;
	static int[][] intMatrix     = new int[n][n];
	static int[][] rotatedMatrix = new int[n][n];

	public static int[][] rotateMatrix (int[][] intMatrix, int n) {
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				rotatedMatrix[j][n-i-1] = intMatrix[i][j];

		return rotatedMatrix;
	}

	public static void main(String[] args) {
		// generate original Matrix
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++) {
				Random r = new Random();
				intMatrix[i][j] = r.nextInt(20);
			}
		// print out original Matrix
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				if(j == n-1)
					System.out.println("   " + intMatrix[i][j]);
				else
					System.out.print("   " + intMatrix[i][j]);

		System.out.println();

		// rotate matrix
		rotateMatrix(intMatrix,n);

		// print out rotated matrix
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++)
				if(j == n-1)
					System.out.println("   " + rotatedMatrix[i][j]);
				else
					System.out.print("   " + rotatedMatrix[i][j]);

	}
}