연결리스트 질문이요..
데이비드
#includestdio.h
#includestdlib.h
#includestring.h
typedef struct listNode* listPointer;
struct listNode {
int data;
listPointer link;
};
typedef struct linkedList* List;
struct linkedList {
listPointer head;
};
List createLinkedList_h(void);
void freeLinkedList(List);
void addLastNode(List, int);
void reverse(List);
void deleteLastNode(List);
void printList(List);
List createLinkedList_h(void) {
List L;
L = (List)malloc(sizeof(L));
L-head = NULL;
return L;
}
void main()
{
linkedList* L;
L = createLinkedList_h();
addLastNode(L, 2);
addLastNode(L, 0);
printList(L);
addLastNode(L, 5);
printList(L);
deleteLastNode(L);
printList(L);
reverse(L);
printList(L);
freeLinkedList(L);
printList(L);
}
void freeLinkedList(List L)
{
listPointer p;
while(L-head != NULL) {
p = L-head;
L-head = L-head-link;
free(p);
p = NULL;
}
}
void addLastNode(List L, int a)
{
listPointer p;
listPointer q;
p = (listPointer)malloc(sizeof(p));
p-data = a;
p-link = NULL;
if(L-head == NULL) {
L-head = p;
return;
}
q = L-head;
while(q-link != NULL)
q = q-link;
q-link = p;
}
void reverse(List L) {
listPointer p;
listPointer q;
listPointer r;
p = L-head;
q = NULL;
r = NULL;
while (p != NULL) {
r = q;
q = p;
p = p-link;
q-link = r;
}
L-head = q;
}
void deleteLastNode(List L) {
listPointer previous;
listPointer current;
if (L-head == NULL)
return;
if (L-head-link == NULL) {
free(L-head);
L-head = NULL;
return;
}
else {
previous = L-head;
current = L-head-link;
while (current-link != NULL) {
previous = current;
current = current-link;
}
free(current);
previous-link = NULL;
}
}
void printList(List L) {
listPointer p;
printf(();
p = L-head;
while (p != NULL) {
printf(%d, p-data);
p = p-link;
if (p != NULL)
printf(, );
}
printf() \n);
}실행할 때 자꾸 오류가 나는데 어떻게 해야 할까요??
-
여신
메모리 동적할당을 잘못 하셨네요.
구조체의 크기만큼 할당한 것이 아니라 구조체 포인터 크기만큼 할당하였습니다.