题解 | #蛇形矩阵#
蛇形矩阵
https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e
#include <stdio.h>
int main() {
int n;
scanf("%d",&n);
int i ,j =0;
int k = 1;
int top[n];
int s = 0;
top[0] = 1;
for(i=1;i<n;i++)
{
top[i] = top[i-1]+k;
k=k+1;
}
for(i=0;i<n;i++)
{
k = i+2;
s = top[i];
for(j=0;j<n-i;j++)
{
printf("%d ",s);
s = s+k;
k = k+1;
}
printf("\n");
}
}
