더블 링커드 리스트에 대한 질문입니다.
집1어치워
프로그램에 오류와 경고는 없으나 프로그램이 실행되지 않네요.질문 요약 :프로그램에 오류와 경고는 없으나 프로그램이 실행되지 않네요.질문 내용 :
DoubleLinked.h
===================================================
#pragma once
//구조체의 정의
typedef struct _NODE
{
char data;
struct _NODE* prev, * next;// 다음과 이전의 멤버를 설정.
}
NODE;
typedef struct
{
NODE* pHead, * pTail; // 머리와 꼬리의 구분.
}
DOUBLE_LIST;
NODE* makeNode(char data);
void addHead(DOUBLE_LIST* pList, char data);
void addTail(DOUBLE_LIST* pList, char data);
void removeHead(DOUBLE_LIST* pList);
void removeTail(DOUBLE_LIST* pList);
void printNormal(DOUBLE_LIST* pList);
void printReverse(DOUBLE_LIST* pList);
char getHead(DOUBLE_LIST* pList);
char getTail(DOUBLE_LIST* pList);
int isEmpty(DOUBLE_LIST* pList);
===================================================
DoubleLinked.c
===================================================
#include stdio.h
#include stdlib.h
#include DoubleLinked.h
NODE* makeNode(char data)
{
NODE* node = malloc(sizeof(NODE));
node-data = data;
node-prev = node-next = NULL;
return node;
}
void addHead(DOUBLE_LIST* pList, char data)
{
NODE* node = makeNode(data); // 새로운 노드를 추가시키는 node.
if(isEmpty(pList) == 1) // pList가 비어있다면 참(1)으로 반환. 비어있지않다면 거짓(0)으로 반환시킨다.
{
pList-pHead = pList-pTail = node;
}
else
{
node-prev = NULL;
node-next = pList-pHead;
pList-pHead-prev = node;
pList-pHead = node;
}
}
void addTail(DOUBLE_LIST* pList, char data)
{
NODE* node = makeNode(data); //
if(isEmpty(pList) == 1)
{
pList-pHead = pList-pTail = node;
}
else
{/nbsp;{
node-prev = pList-pHead;
node-next = NULL;
pList-pTail-next-prev = node;
pList-pTail = node;
}
}
void removeHead(DOUBLE_LIST* pList)
{
if(pList-pHead != NULL)
{
NODE* del = pList-pHead;
if(pList-pHead == pList-pTail)
{
pList-pHead = pList-pTail = NULL;
}
else
{
pList-pHead-next-prev = NULL;
pList-pHead = pList-pHead-next;
}
free(del);
}
}
void removeTail(DOUBLE_LIST* pList)
{
if(pList-pTail != NULL)
{
NODE* del = pList-pTail;
if(pList-pHead == pList-pTail)
{
pList-pHead = pList-pTail = NULL;
}
else
{
pList-pTail-prev-next = NULL;
pList-pTail = pList-pTail-prev;
}
free(del);
}
}
void printNormal(DOUBLE_LIST* pList)
{
NODE* cur;
for(cur = pList-pHead; cur!=NULL;cur=cur-next)
printf(%c, cur-data);
printf(\n);
}
void printReverse(DOUBLE_LIST* pList)
{
NODE* cur;
for(cur = pList-pTail; cur != NULL;cur=cur-prev)
printf(%c, cur-data);
printf(\n);
}
char getHead(DOUBLE_LIST* pList)
{
return pList-pHead-data;
}
char getTail(DOUBLE_LIST* pList)
{
return pList-pTail-data;
}
int isEmpty(DOUBLE_LIST* pList)
{
return pList-pHead == NULL;
}
===================================================
DoubleLinkedMain.c
===================================================
#pragma warning(disable:4996)
#include stdio.h
#include DoubleLinked.h
void main(void)
{
//선언
DOUBLE_LIST list = { 0 };
char s1[] = BLACK,
s2[] = WHITE;
int i;
//추가
printf(** 원본 **\n);
for(i=0;i5;i++)
{
addHead(&list, s1[i]);
addTail(&list, s2[i]);
}
//읽기
printNormal(&list);
printReverse(&list);
printf(머리: %c\n, getHead(&list));
printf(꼬리: %c\n, getTail(&list));
//삭제
printf(\n** 양끝에서 3문자씩 삭제 **\n);
for(i=0;i3;i++)
{
removeHead(&list);
removeTail(&list);
}
printNormal(&list);
printReverse(&list);
printf(머리: %c\n, getHead(&list));
printf(꼬리: %c\n, getTail(&list));
}
===================================================
어느 부분이 잘못 되었는지.. 지적 해주셨으면 합니다.;
잘 부탁드립니다;