栈的实现线性结构

#include<stdio.h>
#include<stdlib.h>
typedef struct Stack {
	int* data;
	int top;
	int size;
}Stack;
Stack* makeStack(int n){
	Stack* S = (Stack*)malloc(sizeof(Stack));
	S->data = (int*)malloc(sizeof(int)*n);
	S->top = -1;
	S->size = n;
	return S;
}
int topStack(Stack* S) {
	if (S == NULL) return 0;
	return S->data[S->top];
}int pushStack(Stack* S,int val) {
	if (S == NULL) return 0;
	S->top += 1;
	S->data[S->top] = val;
	return 1;
}
int popStack(Stack* S) {
	if (S == NULL)return 0;
	S->top -= 1;
	return 1;
}
Stack* clearStack(Stack* S) {
	if (S == NULL) return S;
	free(S);
	return S;
}
int main() {
	return 0;
}