一、顺序表
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 20
typedef struct
{
int data[MAXSIZE];
int length;
}SeqList;
void InitSeq(SeqList *L,int *data,int n){
int i;
L->length = 0;
for(i=0;i<n;i++){
insertSeq(L,data[i],i);
}
}
void insertSeq(SeqList *L,int data,int n){
if(n>MAXSIZE){
printf("输入的人数超过最大值\n");
}else{
L->data[n] = data;
L->length++;
}
}
void circle(SeqList *L){
int i=0;
int k=0;
int j;
int m;
printf("请输入数字为m的出圈\n");
scanf("%d",&m);
while(L->length>1){
i = (i+m-1)%(L->length);
k++;
printf("第%d个出圈的是%d\n",k,L->data[i]);
for(j=i+1;j<L->length;j++){
L->data[j-1] = L->data[j];
}
L->length--;
if(i==L->len