수다닷컴

책을 보고 여기까지는 했는데 그담에 진행을 못하겠네요...
정답은 오른쪽 그림 2파일로 나와해요...
링크드모양이 안나와요..

#include malloc.h
#include stdbool.h
#include stdio.h

typedef struct node{
void** dataArrPtr;
struct node* link;
} STACK_NODE;

typedef struct
{
intarrSize;
int count;
STACK_NODE*top;
} STACK;
STACK* createStack(int arrSize){
STACK* stack;
stack = (STACK*) malloc(sizeof(STACK));
if (stack)
{
stack-arrSize = arrSize;
stack-count = 0;
stack-top = NULL;
}
return stack;
}bool pushStack(STACK* stack, void* dataInPtr)
{
STACK_NODE* newPtr;
newPtr = (STACK_NODE*)malloc(sizeof(STACK_NODE));
if (!newPtr)
return false;

newPtr-dataArrPtr = dataInPtr;

newPtr-link = stack-top;
stack-top = newPtr;(stack-count)++;
return true;
}

void* popStack(STACK* stack)
{
void*dataOutPtr;
STACK_NODE* temp;

if(stack-count ==0)
dataOutPtr = NULL;
else
{
temp= stack-top;
dataOutPtr = stack-top-dataArrPtr;
stack-top = stack-top-link;
free(temp);
(stack-count)--;
}
return dataOutPtr;
}

void* stackTop(STACK* stack)
{
if(stack-count == 0)
return NULL;
else
return stack-top-dataArrPtr;
}

bool emptyStack(STACK* stack)
{
return(stack-count == 0);
}

bool fullStack(STACK* stack)
{
STACK_NODE* temp;

if ((temp =
(STACK_NODE*)malloc (sizeof(*(stack-top)))))
{
free (temp);
return false;
}
return true;
}

int stackCount(STACK* stack)
{
return stack-count;
}

void printStack(STACK* s)
{
int i,t,printCount=0;
STACK_NODE* node = s-top;
printf(Stack 의 상태!\n);
printf(===========================================================================\n);

if(s-count == 0) printf(empty\n);
else
{
while(printCounts-count)
{
if( s-top == node ) t=(s-count-1)%(s-arrSize);
else t=(s-arrSize-1);
for(i=0;i=t;i++){
printf(%6d,*((int*)((node-dataArrPtr)[i])));
printCount++;
}
node = s-top-link;
printf(\n);
}
}
printf(===========================================================================\n);
}

int main(void){

int result=0;
int sizeInput=1;
int* value;

STACK *st;
printf(Array 사이즈를 입력하세요! : );
scanf(%d,&sizeInput);
st = createStack(sizeInput);

while(result!=4){
printf(메뉴를 입력하세요.\n1.push 2.pop 3.stackTop 4.quit\n: );
scanf(%d,&result);
if(result1 || result4)
{
result=0;
}
else if(result==1)
{
printf(값을 입력하세요.\n: );
value =(int*)malloc(sizeof(int));
scanf(%d,value);
if(pushStack(st,value)) printf(Pushtf(Push 되었습니다! : %d\n,*value);
elseprintf(Push가 실패했습니다!\n);
printStack(st);
}
else if(result==2)
{
if(st-count0){
printf(Pop 되었습니다! : %d\n,*((int *)popStack(st)));
printStack(st);
}
else printf(스택이 비어서 Pop 할 수 없습니다.\n);
}

else if(result==3)
{
if(st-count0){
printf(stackTop 결과 : %d\n,*((int *)stackTop(st)));
printStack(st);
}
else printf(스택이 비어서 stackTop 할 수 없습니다.\n);
}
}

}

신청하기