1.未用链表实现
#include <stdio.h>
#define N 13
struct student
{
int number;
int nextp;
}person[N+1];
int main()
{
int i, count, h;
for (i = 1; i <= N; i++)
{
if (i == N)
person[i].nextp = 1;
1.未用链表实现
#include <stdio.h>
#define N 13
struct student
{
int number;
int nextp;
}person[N+1];
int main()
{
int i, count, h;
for (i = 1; i <= N; i++)
{
if (i == N)
person[i].nextp = 1;