顺序栈的C语言实现

typedef struct {
	int* base;
	int* top;
	int stacksize;
}SqStack;

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"head.h"


void Init_sq(SqStack* sta)  // Functio Init spares memory for pointer base and top.
{
	sta->base = (int*)malloc(10 * sizeof(int));
	if (!sta->base) { printf("error!"); }
	sta->top = sta->base;
	sta->stacksize = maxsize;
}


void StackEmpty(SqStack* sta)
{
	if (sta->base == sta->top) { printf("Empty.\n"); }
	else { printf("Not empty.\n"); }
}


void StackLength(SqStack* sta)
{
	printf("The length of the stack is %d.\n", sta->top - sta->base);
}


void ClearStack(SqStack* sta)
{
	if (sta->base) { sta->top = sta->base;  }
}


void DestoryStack(SqStack* sta) { if (sta) { free(sta);  } }


void Push(SqStack* sta)
{
	int i;
	if (sta->top - sta->base == sta->stacksize) { printf("ERROR! Stack is full.\n");  }
	printf("Input the number you want to push in:\n");
	scanf_s("%d", &i);
	setvbuf(stdin, NULL, _IOFBF, 512);
	*sta->top = i;
	/*printf("Position: %p\n", sta->top);
	  printf("%d\n", *sta->top);
	  Input: 2
	  Output: address, 2*/
	sta->top++;  // The auto increment operation on the pointer will change the address of the pointer accordingly (address + 4 bytes(one int) in length).
	/*printf("%d\n", *sta->top);
	  printf("Position: %p\n", sta->top); 
	  Output: address+4, a rondom number*/
	// The 50 line shows this is a linear stack.
}


void Pop(SqStack* sta)
{
	int e;
	if (sta->base == sta->top) { printf("ERROR!"); }
	--sta->top;
	e = *sta->top;
	printf("The number poped is %d\n", e);
}

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include"head.h"


int main()
{	
	SqStack *sqs = (SqStack*)malloc(sizeof(SqStack));
	Init_sq(sqs);
	Push(sqs);  //这些部分内容可自行修改
	Push(sqs);
	Push(sqs);
	StackLength(sqs);
	Pop(sqs);
	Pop(sqs);
	StackLength(sqs);
	return 0;
}