记得大一上 c 语言的时候就碰到过这个问题 ,当时很菜 ,完全不会 ,今天没事上网看到这个似乎也成面试题了,就用各种方法个做了一遍 ,现在思路小case ,就是细节还搞了半天
题目 : 生成
[43, 44, 45, 46, 47, 48, 49, 50]
[42, 21, 22, 23, 24, 25, 26, 51]
[41, 20, 7, 8, 9, 10, 27, 52]
[40, 19, 6, 1, 2, 11, 28, 53]
[39, 18, 5, 4, 3, 12, 29, 54]
[38, 17, 16, 15, 14, 13, 30, 55]
[37, 36, 35, 34, 33, 32, 31, 56]
[64, 63, 62, 61, 60, 59, 58, 57]
螺旋矩阵,思路就是从内到外 ,一卷卷来喽
方法1:
从内到外 ,一卷卷来喽
方法2:
设数字1的位置 坐标为 [0,0] ,其实 每个位置 ,都可以单纯由 坐标 x,y 生成的
代码 如下 :
class Test {
//方法1 ,直接生成矩阵
private static int[][] spinGenerate(int level) {
int size = level * 2;
int[][] m = new int[size][size];
int cL = 1;
int startX = (size - 1) / 2;
int startY = (size - 1) / 2;
int count = 1;
for (cL = 1; cL <= level; cL++) {
int subSize = cL * 2 - 1;
//当前圈的各个边、
for (int i = 0; i < subSize - 1; i++) {
m[startX--][startY] = count++;
}
for (int i = 0; i < subSize; i++) {
m[startX][startY++] = count++;
}
for (int i = 0; i < subSize; i++) {
m[startX++][startY] = count++;
}
for (int i = 0; i < subSize + 1; i++) {
m[startX][startY--] = count++;
}
}
return m;
}
//方法 2:坐标 与 值 的函数
public static int getXy(int x, int y) {
if (x == 0 && y == 0) return 1;
int level = Math.max(Math.abs(x), Math.abs(y));
//解决不对称性
if (x < 0 && level == -x) level++;
else if (y < 0 && level == -y) level++;
int size = level * 2;
//左下角值
// int ldMax = ((level - 1) * 2 * 4 + 4 + 4) * level / 2;
int ldMax = (level * 2 * 4) * level / 2;
//四个圈线 分别判断
if (y == (level)) {
return ldMax - (size - 1) * 2 + (x - (1 - level));
}
if (y == (1 - level)) {
if (x == level) return ldMax;
return ldMax - (size - 1) * 3 - (x - (1 - level));
}
if (x == (level)) {
return ldMax - (y - (1 - level));
}
return ldMax - (size - 1) * 3 + (y - (1 - level));
}
public static void main(String[] args) {
int[][] base = spinGenerate(4);
for (int i = 0; i < base.length; i++) {
System.out.println(Arrays.toString(base[i]));
}
System.out.println();
System.out.println();
System.out.println();
for (int i = (1 - base.length) / 2; i <= base.length / 2; i++) {
System.out.print("[");
for (int j = (1 - base.length) / 2; j <= base.length / 2; j++) {
System.out.print(getXy(i, j) + ",");
}
System.out.println("]");
}
}
}