Kata系列之回型矩阵: 用java代码打印出“回”字形矩阵

package test;


/**
 * 回型矩阵: 用java代码打印出“回”字形矩阵，例如1-9的三阶矩阵的输出顺序为：1 2 3 8 9 4 7 6 5
 * 
 * @author huawangxin
 * @date 2017年2月22日 下午1:22:20
 */
public class HuiMatrix {
static int length = 3;
static int value = 1;
static int[][] snake = new int[length][length];
static Direction lastDirection = Direction.Right;


static enum Direction {
Right, Down, Left, Up;
}


public static void main(String[] args) {
initialArray();
print(snake);
}


public static void initialArray() {
int row = 0, col = 0;
for (int i = 0; i < length * length; i++) {
snake[row][col] = value;
lastDirection = findDirection(row, col);
switch (lastDirection) {
case Right:
col++;
break;
case Down:
row++;
break;
case Left:
col--;
break;
case Up:
row--;
break;
default:
System.out.println("error");
}
value++;
}
}


/**
* 判断下一个数据存放的位置方向
* @param row
* @param col
* @return
* @author huawangxin
*/
static Direction findDirection(int row, int col) {
Direction direction = lastDirection;
// No.1
// 开始写代码，补充完整代码，输出8阶回型矩阵
switch (direction) {
case Right: {
if (row==0&&col>=2)
direction=Direction.Down;
break;
}
case Down: {
if (row==2&&col>=2)
direction=Direction.Left;
break;
}
case Left: {
if (row==2&&col<=0)
direction=Direction.Up;
break;
}
case Up: {
if (row==1&&col<=0)
direction=Direction.Right;
break;
}
}
// end_code
return direction;
}


static void print(int[][] arr) {
for (int i = 0; i < length; i++) {
for (int j = 0; j < length; j++) {
System.out.printf(" %2d", arr[i][j]);
}
System.out.println();
}
}
}