Java实现——顺时针打印N阶方阵

转自几个面试经典算法题（http://www.cnblogs.com/sunniest/p/4596182.html）题目一

用递归的方法顺时针打印N阶方阵。先打印最外一圈，然后递归打印剩余内部的(N-2)阶方阵

//print element of square matrix clockwise
public class ClockwiseMatrix {

public void print(int[][] matrix , int start , int end){
if(start > end || end < 0)
return;
for(int i = start ; i <= end ; i++){
System.out.print(matrix[start][i] + " ");
}
for(int i = start + 1 ; i <= end ; i++){
System.out.print(matrix[i][end] + " ");
}
for(int i = end - 1 ; i >= start ; i--){
System.out.print(matrix[end][i] + " ");
}
for(int i = end - 1 ; i >=start + 1 ; i--){
System.out.print(matrix[i][start] + " ");
}
print(matrix , start + 1 , end - 1);
}
public static void main(String[] args) {
int[][] a = new int[5][5];
int count = 0;
for(int i = 0 ; i < 5 ; i++){
for(int j = 0 ; j < 5 ; j++){
a[i][j] = count++;
}
}
ClockwiseMatrix cm = new ClockwiseMatrix();
cm.print(a, 0, 4);
}
}