수다닷컴

질문 제목 : 자료구조에서 자료구조에서 포인터구조체...질문 내용 :
#include stdafx.h
#include stdlib.h
#define is_full(ptr) (!(ptr))
#define is_empty(ptr) (!(ptr))
#define max_stacks 10
typedef struct {
int key;
} element;
typedef struct stack *stack_pointer;
typedef struct stack {
element item;
stack_pointer link;
};
stack_pointer top[max_stacks];
void print_stack(stack_pointer ptr);
void addstack(stack_pointer *top, element item);
element deletestack(stack_pointer *top);
void main()
{
int choice, loop=1;
element key,item;
int i = 0;
top[i]=null;

while (loop) {
printf( 원하시는작업: \n);
printf( 0: 종료 \n);
printf( 1: 스택에 숫자삽입 \n);
printf( 2: 스택에 숫자삭제 \n);
scanf(%d, &choice);
switch (choice) {
case 1:
printf(숫자입력: );
scanf(%d, key); ----이부분의 숫자를 입력받는부분과
addstack(&top[i],item);

break;
case 2:
item = deletestack(&top[i]);
break;
default:
loop = 0;
}
}
}
void print_stack(stack_pointer top) print_stack함수를 구현하는 방법을 모르겠네요 ㅠㅠㅠ이게맞는지..
{
printf(the stack contains: );
for(; top; top=top-link)
printf(%4d,top-item);
printf(\n);
}
void addstack(stack_pointer *top, element item)
{
stack_pointer temp = (stack_pointer) malloc(sizeof (stack));
if(is_full(temp)) {
fprintf(stderr, the memory is full\n);
exit(1);
}
temp-item=item;
temp-link=*top;
*top = temp;
}
element deletestack(stack_pointer *top)
{
stack_pointer temp = *top;
element item;
if(is_empty(temp)) {
fprintf(stderr, the stack is empty\n);
exit(1);
}
item = temp-item;
*top = temp-link;
free(temp);
return item;
}

신청하기