수다닷컴

#include stdio.h
#include stdlib.h
#define MAX_LIST_SIZE 100
typedef int element;
typedef struct
{
element list[MAX_LIST_SIZE];
int length;
}ArrayListType;
//======================= 함수 선언 =======================//
void error(char *message);
void init(ArrayListType *L);
void display(ArrayListType *L);
void add(ArrayListType *L, int position, element item);
element del(ArrayListType *L, int position);
int is_empty(ArrayListType *L);
int is_full(ArrayListType *L);
//========================================================//
int main(void)
{
ArrayListType list1;
ArrayListType *plist;
init(&list1);
add(&list1, 0, 10);
add(&list1, 0, 20);
add(&list1, 0, 30);
display(&list1);
plist = (ArrayListType *)malloc(sizeof(ArrayListType));
init(plist);
add(plist, 0, 10);
add(plist, 0, 20);
add(plist, 0, 30);
display(plist);
free(plist);
return 0;
}
//======================= 함수 정의 =======================//
void error(char *message)
{
fprintf(stderr, %s\n, message);
exit(1);
}
void init(ArrayListType *L)
{
L-length = 0;
}
void display(ArrayListType *L)
{
int i;

for(i = 0; i L-length; i++)
printf(%d\n, L-list[i]);
}
void add(ArrayListType *L, int position, element item)
{
if(!is_full(L) && (position = 0) && (position = L-length))
{
int i;
for(i = (L-length-1); i = position; i--)
L-list[i+1] = L-list[i];
L-list[position] = item;
L-length;
}
}
element del(ArrayListType *L, int position)
{
int i;
element item;
if(position 0 || position = L-length)
error(위치 오류);
item = L-list[position];
for(i = position; i (L-length-1); i++)
L-list[i] = L-list[i+1];
L-length--;
return item;
}
int is_empty(ArrayListType *L)
{
return L-length == 0;
}
int is_full(ArrayListType *L)
{
return L-length == MAX_LIST_SIZE;
}
//========================================================//

배열을 이용한 리스트를 만드는 소스인데요,
이상하게 이대로 입력하면 리스트 출력이 전혀 안 됩니다;;
어디가 문제인가요??

신청하기