数组指针存储在堆栈的形式

转载

mob604756f80175 2015-09-08 11:07:00

文章标签 出栈 #define #include 数组入栈 文章分类 运维

#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#define ERROR 0
#define OK 1
#define STACK_INT_SIZE 10  /*存储空间初始分配量*/
typedef  int ElemType; /*定义元素的类型*/
typedef struct{
    ElemType *base;
    ElemType *top;

}SqStack;

int InitStack(SqStack *S);   /*构造空栈*/
int push(SqStack *S,ElemType e); /*入栈*/
int Pop(SqStack *S,ElemType *e);  /*出栈*/
int CreateStack(SqStack *S);     /*创建栈*/
void PrintStack(SqStack *S);   /*出栈并输出栈中元素*/

int InitStack(SqStack *S){
    S->base=(ElemType *)malloc(STACK_INT_SIZE *sizeof(ElemType));


    if(!S->base) return ERROR;
    S->top=S->base;
    return OK;
}/*InitStack*/

int Push(SqStack *S,ElemType e){
  if(S->top-S->base==STACK_INT_SIZE) //推断栈满
      return ERROR;
*(S->top)=e;//S->top=&e是错的
S->top++;
return OK;

}/*Push*/

int Pop(SqStack *S,ElemType *e){

     if(S->base==S->top) 
return ERROR;
*e=*(S->top-1);//e=S->top-1为啥是错的呢
S->top--;
return OK; 

}/*Pop*/

int CreateStack(SqStack *S){
    int e;
    if(InitStack(S))
        printf("Init Success!\n");
    else{
        printf("Init Fail!\n");
        return ERROR;
    }
    printf("input data:(Terminated by inputing a character)\n");
    while(scanf("%d",&e))
        Push(S,e);
    return OK;
}/*CreateStack*/

void PrintStack(SqStack *S){
    ElemType e;
    while(Pop(S,&e))
        printf("%3d",e);
}/*Pop_and_Print*/

int main(){
    SqStack ss;
    printf("\n1-createStack\n");
    CreateStack(&ss);
    printf("\n2-Pop&Print\n");
    PrintStack(&ss);
  printf("\n");
    return 0;
}