题解 | 回型矩阵
回型矩阵
https://www.nowcoder.com/practice/36d5dfddc22c4f5b88a5b2a9de7db343
#include <stdio.h>
int main() {
int arr[19][19] = {0};
int n = 0;
scanf("%d",&n);
int up = 0, left = 0, right = n - 1, down = n - 1;
int num = 1;
while (num <= n * n) {
for (int i = left; i <= right; i++) {
arr[up][i] = num++;
}
up++;
for (int i = up; i <= down; i++) {
arr[i][right] = num++;
}
right--;
for (int i = right; i >= left; i--) {
arr[down][i] = num++;
}
down--;
for (int i = down; i >= up; i--) {
arr[i][left] = num++;
}
left++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
printf("%d ",arr[i][j]);
}
printf("\n");
}
return 0;
}
查看29道真题和解析
投递三维家等公司10个岗位