这是一道找规律题，难在如何从下往上，从右往左绕过来 看完题解，加入团队吧

#include<iostream> using namespace std; int main(){ int a[105][105]; int n; cin>>n; int cnt=1,i=1,j=1;//cnt是要填的数，i是行，j是列 while(cnt<=n*n){ while(a[i][j]==0&&j<=n){ a[i][j]=cnt;; j++; cnt++; } j--; i++; while(a[i][j]==0&&i<=n){ a[i][j]=cnt; i++; cnt++; } i--; j--; while(a[i][j]==0&&j>=1){ a[i][j]=cnt; cnt++; j--; } j++; i--; while(a[i][j]==0&&i>=1){ a[i][j]=cnt; cnt++; i--; } i++; j++; } for(int w=1;w<=n;w++){ for(int t=1;t<=n;t++){ cout<<a[w][t]<<" "; } cout<<endl; } return 0; }

#include <stdio.h> int main(){ int n, i = 0, j = 0, a[120][120] = {0}, tot = 0; scanf("%d", &n); int num = a[0][0] = 1; while (num < n*n){ while (j+1 < n && !a[i][j + 1]){ a[i][++j] = ++num; } while (i +1 < n && !a[i + 1][j]){ a[++i][j] = ++num; } while (j-1 >= 0 && !a[i][j - 1]){ a[i][--j] = ++num; } while (i -1>= 0 && !a[i - 1][j]){ a[--i][j] = ++num; } }