res.java

逆时针螺旋矩阵。把1到N*N的整数按逆时针螺旋放于一个N*N的矩阵当中。

public class Res {
	
	public int[][] create()
	{
		// 矩阵长度
		final int N = 9;
		// 逆螺旋矩阵
		int[][] arr = new int[N][N];
		int d = 1;
		int x = 0; // X坐标
		int y = 0; // Y坐标

		while (true) {
			arr[x][y] = d++;

			// 各方向 的可行性
			boolean left = (y > 0) && (arr[x][y - 1] == 0);
			boolean down = (x < N - 1) && (arr[x + 1][y] == 0);
			boolean right = (y < N - 1) && (arr[x][y + 1] == 0);
			boolean up = (x > 0) && (arr[x - 1][y] == 0);

			// 判断前进方向
			if (left)
				if (up)
					x--;
				else
					y--;
			else if (down)
				x++;
			else if (right)
				y++;
			else if (up)
				x--;
			else
				break;
		}
		// 输出数组
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < N; j++) {
				System.out.print(arr[i][j] + "\t");
			}
			System.out.println();
		}

		/*
		 * System.out.println("<table>"); for (int i = 0; i < N; i++) {
		 * System.out.println("<tr>"); for (int j = 0; j < N; j++) {
		 * System.out.print("<td>"); System.out.print(arr[i][j]);
		 * System.out.println("</td>"); } System.out.println("</tr>"); }
		 * System.out.println("</table>");
		 */

		/* 放在原来的函数下 */
		/* 当元素为－1时涂黑，为0时空白，为整数时输入 */
		int addRow = 0; // 要增加的行
		int addCol = 0; // 要增加的列

		int old = N;
		while (old > 2) {
			old = old - 2;
			addRow++;
		}
		addCol = 2 * (N - 1);
		System.out.println("row:" + addRow + "\t" + "col:" + addCol);
		
		int newRow = addRow + N; // 新行数
		int newCol = addCol + N; // 新列数
		// 重新要打印出来的矩阵
		int[][] newArr = new int[newRow][newCol];

		// 写入顶部
		if (N % 2 == 0) {
			newArr[0][newCol / 2 - 1] = -1;
			newArr[0][newCol / 2] = -1;

			int low = newCol / 2 - 1;
			int height = newCol / 2;
			for (int k = 1; k < addRow; k++) {
				low = low - 1;
				height = height + 1;
				for (int m = low; m <= height; m++) {
					newArr[k][m] = -1;
				}
			}
		} else {
			newArr[0][newCol / 2] = -1;
			int low = newCol / 2;
			int height = newCol / 2;

			for (int k = 1; k < addRow; k++) {
				low = low - 1;
				height = height + 1;
				for (int m = low; m <= height; m++) {
					newArr[k][m] = -1;
				}
			}

		}
		// 写入原来的数据
		// int px=0;
		// int py=0;
		for (int p = addRow, px = 0; p < (N + addRow); p++, px++) {
			for (int q = addCol / 2, py = 0; q < (N + addCol / 2); q++, py++) {
				newArr[p][q] = arr[px][py];
			}

		}
		// 写入左右边
		int low = addCol / 2 - 1;
		int height = addCol / 2 + N;
		for (int i = addRow + 1; i < newRow; i++) {
			//右边
			for (int j = addCol / 2 + N; j <= height; j++) {
				newArr[i][j] = -1;
			}
			height++;
			//左边
			for (int l = low; l < addCol / 2; l++) {
				newArr[i][l] = -1;
			}
			low--;
		}
		for (int i = 0; i < newRow; i++) {			
			for (int j = 0; j < newCol; j++) {
				System.out.print(newArr[i][j] + "\t");
			}
			System.out.println();
		}
		return newArr;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Res res = new Res();
		int newArr[][] = res.create();
		int length = newArr.length;
		System.out.println(length);
				

		// 输出数组
		/*for (int i = 0; i < newRow; i++) {			
			for (int j = 0; j < newCol; j++) {
				System.out.print(newArr[i][j] + "\t");
			}
			System.out.println();
		}*/

	}

}