수다닷컴

질문 제목 : 이중연결리스트 삭제함수가 되지않음질문 요약 :이중연결리스트 삭제부분중 가운데노드 삭제가 되지않습니다
빨간색 주석부분이 읽혀지지않습니다.그런데 삭제할 노드가 마지막일 경우는 삭제가 됩니다;;;질문 내용 :
#includestdio.h
#includemalloc.h
#includestring.h

typedef struct address_
{
struct address_ *prev;
char name[30];
char num[30];
char address[50];
struct address_ *next;
}node; //구조체에 typedef를 선언해 node를 구조체명으로 사용
void address_add(node *);
void address_del(node *);
void address_print(node *);
void address_search(node *);

main()
{

node *add;
int s;
add=(node *)malloc(sizeof(node));
add-prev=null;
add-next=null;while(1)
{
printf(1:주소록 추가 2:주소록 삭제 3:주소록 검색 4:주소록 출력 9:종료\n);
scanf(%d,&s);

if(s == 9)break;
switch(s)
{

case 1:
address_add(add);
break;
case 2:
address_del(add);
break;
case 3:
address_search(add);
break;
case 4:
address_print(add);
break;
}}
}

void address_add(node *add)
{

node *pmove;
node *move;
node *newnode;
newnode=(node *)malloc(sizeof(node));
newnode-next=null;if(add-next == null)
{

add-next=newnode;
newnode-prev=add;

printf(이름을 입력하시오\n);
scanf(%s,newnode-name);
printf(번호를 입력하시오\n);
scanf(%s,newnode-num);
printf(주소를 입력하시오\n);
scanf(%s,newnode-address);
printf(%s %s %s\n,newnode-name,newnode-num,newnode-address);
printf(%d\n%d\n%d\n%d\n,add,newnode-prev,add-next,newnode);
}
else
{

move=add;

while(move-next-next !=null)
{
move=move-next;

}
pmove=move-next;

move-next-next=newnode;

printf(이름을 입력하시오\n);
scanf(%s,newnode-name);
printf(번호를 입력하시오\n);
scanf(%s,newnode-num);
printf(주소를 입력하시오\n);
scanf(%s,newnode-address);
newnode-prev=pmove;

printf(%s %s %s\n,newnode-name,newnode-num,newnode-address);

printf(%d\n%d\n%d\n%d\n,newnode-prev,move-next,newnode,move-next-next);}

}void address_del(node *add)
{
char name[30];
int x;
node *pmove;
node *move;
move=add;

if(move-next == null)
{
printf(삭제할 주소목록이 없습니다\n);
}

if(move-next != null)
{

&printf(삭제할 이름을 입력하시오\n);
scanf(%s,name);

while(move-next != null)
{
x=strcmp(move-next-name,name);

if(x != 0)
{
move=move-next;

}

if(x == 0)
{if(move-next-next == null)
{
free(move-next);
move-next=null;
}break;
/*
if(move-next-next != null)
{
move-next-next-prev=move;
pmove=move-next-next;
free(move-next);
move-next=pmove;

}break;
*/
}if(move-next == null)break;
}
}}
void address_search(node *add)
{
char name[30];
int x;
node *pmove;
node *move;
move=add;

if(add-next == null)
{
printf(검색 할 주소목록이 없습니다\n);
}

if(add-next!=null)
{

printf(검색 할 이름을 입력하시오\n);
scanf(%s,name);

while(move-next != null)
{
x=strcmp(move-next-name,name);

if(x != 0)
{
move=move-next;

}

if(x == 0)
{printf(%s\n,move-next-name);
printf(%s\n,move-next-num);
printf(%s\n,move-next-address);

}
if(x == 0)break;
}
}
}
void address_print(node *add)
{
node *move;
move=add;
if(move-next == null)
{
printf(출력할 주소록이 없습니다\n);
}
while(move-next != null)
{
printf(%s\n,move-next-name);
printf(%s\n,move-next-num);
printf(%s\n,move-next-address);
move=move-next;
}

}

신청하기