Question

关于c语言栈的问题，下面是我自己写的一个代码，无法运行的，无高手大神指教，感激不尽。。

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
typedef int elemtype;
typedef struct Stack{
elemtype *top;
elemtype *base;
int stacksize;
}Stack,*Sqstack;
void creat(Sqstack s)
{
s->base=(elemtype*)malloc(sizeof(Stack));
s->top=s->base;
s->stacksize=MAXSIZE;
}
void againmalloc(Sqstack s)
{
s->base=(elemtype*)realloc(s->base,2*s->stacksize*sizeof(elemtype));
}
void push(Sqstack s)
{
if(s->top-s->base>=s->stacksize)
againmalloc(s);
s->top=s->base+s->stacksize;
scanf("%d",s->base);
}
void pop(Sqstack s)
{
if(s->top==s->base)
printf("空栈\n");
else
printf("%d ",*s->top);
}
int main()
{
Sqstack s;
creat(s);
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
push(s);
}
for(i=0;i<n;i++)
{
pop(s);
}
return 0;
}

Answer 1

// 栈用一个 next　指针和一个key 就可以完成．不需要用数组．
//　入栈时用前插，出栈时用前删 就行，　
//程序你应该可以看懂．

#include <stdio.h>
#include <stdlib.h>

typedef int elemtype;
struct Stack ;
typedef struct Stack {
struct Stack *next;
int key;
}Stack_t;

void creat(Stack_t **s)
{
*s = (Stack_t *)malloc( sizeof( Stack_t ));
bzero( *s, sizeof( Stack_t ));
}

void push(Stack_t **s)
{
Stack_t *tmp = (Stack_t *)malloc( sizeof( Stack_t )) ;
bzero(tmp, sizeof( Stack_t ));
scanf( "%d", &(tmp->key));
getchar();
tmp->next = *s; //前插
*s = tmp;
}
int pop(Stack_t **s)
{
if( *s == NULL ){
printf( " Stack is empty !!!\n");
return -1;
}
Stack_t *tmp = (*s); //　前删.
*s = (*s)->next; //头节点向下移．
printf( "pop: key = %d", tmp->key);
free(tmp);
tmp = NULL;
return 0;
}

int main(int argc, char **argv )
{
Stack_t *head = NULL;
creat(&head);
int i,n = 8;
printf("input Num:");
for(i=0; i<n; i++) {
push(&head);
}
while( 0 == pop(&head)){
//删除完毕后就退出．;
}

return 0;
}

Answer 2

你的*Sqstack也要给个空间他吧。试一下这个
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
typedef int elemtype;
typedef struct Stack{
elemtype *top;
elemtype *base;
int stacksize;
}Stack,*Sqstack;
void creat(Sqstack s)
{
s->base=(elemtype*)malloc(sizeof(Stack));
s->top=s->base;
s->stacksize=MAXSIZE;
}
void againmalloc(Sqstack s)
{
s->base=(elemtype*)realloc(s->base,2*s->stacksize*sizeof(elemtype));
}
void push(Sqstack s)
{
if(s->top-s->base>=s->stacksize)
againmalloc(s);
s->top=s->base+s->stacksize;
scanf("%d",s->base);
}
void pop(Sqstack s)
{
if(s->top==s->base)
printf("空栈\n");
else
printf("%d ",*s->top);
}
int main()
{
struct Stack *s;
s=(Struct Stack*)malloc(sizeof(Struct Stack));
//Sqstack s;
creat(s);
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
push(s);
}
for(i=0;i<n;i++)
{
pop(s);
}
return 0;
}