约瑟夫问题代码之数据结构

/*约瑟夫问题demo01*/

#include <stdio.h>
#include <malloc.h>
#include<windows.h>

#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0

typedef int ElemType;
typedef int Status;

typedef struct{
ElemType *elem;
int length;
int listsize;
}Joseph,Sqlist;

Status InitList_sq(Joseph *L)
{
       L->elem=(ElemType *)malloc(LIST_INIT_SIZE*sizeof(ElemType));
       if(!L->elem) return ERROR;
       L->length=0;
       L->listsize=LIST_INIT_SIZE;
       return OK;
}//建立线性表